./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/xor1.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 fa90627ffc045ef90595d49d60ca0f6095b53b667a9d0f028eb93e7bf4c6c579 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:18:37,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:18:37,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:18:37,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:18:37,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:18:37,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:18:37,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:18:37,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:18:37,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:18:37,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:18:37,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:18:37,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:18:37,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:18:37,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:18:37,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:18:37,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:18:37,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:18:37,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:18:37,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:18:37,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:18:37,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:18:37,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:18:37,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:18:37,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:18:37,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:18:37,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:18:37,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:18:37,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:18:37,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:18:37,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:18:37,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:18:37,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:18:37,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:18:37,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:18:37,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:18:37,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:18:37,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:18:37,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:18:37,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:18:37,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:18:37,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:18:37,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:18:37,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:18:37,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:18:37,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:18:37,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:18:37,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:18:37,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:18:37,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:18:37,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:18:37,267 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:18:37,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:18:37,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:18:37,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:18:37,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:18:37,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:18:37,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:18:37,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:18:37,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:18:37,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:18:37,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:18:37,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:18:37,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:18:37,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:18:37,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:18:37,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:18:37,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:18:37,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:18:37,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:18:37,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:18:37,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:18:37,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:18:37,281 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:18:37,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:18:37,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:18:37,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa90627ffc045ef90595d49d60ca0f6095b53b667a9d0f028eb93e7bf4c6c579 [2022-02-20 14:18:37,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:18:37,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:18:37,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:18:37,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:18:37,515 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:18:37,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor1.i [2022-02-20 14:18:37,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62508a6ce/987e0bbdb8754d199f19979042482c29/FLAG6011de466 [2022-02-20 14:18:37,916 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:18:37,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor1.i [2022-02-20 14:18:37,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62508a6ce/987e0bbdb8754d199f19979042482c29/FLAG6011de466 [2022-02-20 14:18:37,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62508a6ce/987e0bbdb8754d199f19979042482c29 [2022-02-20 14:18:37,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:18:37,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:18:37,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:18:37,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:18:37,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:18:37,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:18:37" (1/1) ... [2022-02-20 14:18:37,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec24c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:37, skipping insertion in model container [2022-02-20 14:18:37,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:18:37" (1/1) ... [2022-02-20 14:18:37,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:18:37,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:18:38,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor1.i[1285,1298] [2022-02-20 14:18:38,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:18:38,148 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:18:38,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor1.i[1285,1298] [2022-02-20 14:18:38,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:18:38,206 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:18:38,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38 WrapperNode [2022-02-20 14:18:38,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:18:38,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:18:38,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:18:38,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:18:38,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,262 INFO L137 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2022-02-20 14:18:38,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:18:38,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:18:38,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:18:38,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:18:38,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:18:38,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:18:38,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:18:38,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:18:38,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (1/1) ... [2022-02-20 14:18:38,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:18:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:38,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:18:38,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:18:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:18:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:18:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:18:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:18:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:18:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:18:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:18:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-02-20 14:18:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-02-20 14:18:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:18:38,468 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:18:38,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:18:38,657 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:18:38,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:18:38,663 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:18:38,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:18:38 BoogieIcfgContainer [2022-02-20 14:18:38,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:18:38,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:18:38,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:18:38,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:18:38,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:18:37" (1/3) ... [2022-02-20 14:18:38,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d120243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:18:38, skipping insertion in model container [2022-02-20 14:18:38,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:18:38" (2/3) ... [2022-02-20 14:18:38,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d120243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:18:38, skipping insertion in model container [2022-02-20 14:18:38,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:18:38" (3/3) ... [2022-02-20 14:18:38,685 INFO L111 eAbstractionObserver]: Analyzing ICFG xor1.i [2022-02-20 14:18:38,689 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:18:38,689 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:18:38,724 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:18:38,732 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:18:38,733 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:18:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:18:38,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:38,754 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:38,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash -141219973, now seen corresponding path program 1 times [2022-02-20 14:18:38,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:38,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272796697] [2022-02-20 14:18:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 14:18:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:38,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {47#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:38,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(<= xor_~i~0 1)} assume !(~i~0 < 100); {30#false} is VALID [2022-02-20 14:18:38,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 14:18:38,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:18:38,981 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30#false} {30#false} #65#return; {30#false} is VALID [2022-02-20 14:18:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 14:18:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:39,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {29#true} is VALID [2022-02-20 14:18:39,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume !(~i~0 < 100); {29#true} is VALID [2022-02-20 14:18:39,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29#true} is VALID [2022-02-20 14:18:39,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#true} assume true; {29#true} is VALID [2022-02-20 14:18:39,008 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29#true} {30#false} #67#return; {30#false} is VALID [2022-02-20 14:18:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 14:18:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:39,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {29#true} is VALID [2022-02-20 14:18:39,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume !(~i~0 < 100); {29#true} is VALID [2022-02-20 14:18:39,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29#true} is VALID [2022-02-20 14:18:39,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#true} assume true; {29#true} is VALID [2022-02-20 14:18:39,046 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29#true} {30#false} #69#return; {30#false} is VALID [2022-02-20 14:18:39,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {29#true} is VALID [2022-02-20 14:18:39,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {31#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:39,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < 100); {30#false} is VALID [2022-02-20 14:18:39,049 INFO L272 TraceCheckUtils]: 3: Hoare triple {30#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {29#true} is VALID [2022-02-20 14:18:39,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {47#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:39,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#(<= xor_~i~0 1)} assume !(~i~0 < 100); {30#false} is VALID [2022-02-20 14:18:39,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 14:18:39,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:18:39,051 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30#false} {30#false} #65#return; {30#false} is VALID [2022-02-20 14:18:39,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {30#false} is VALID [2022-02-20 14:18:39,053 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {29#true} is VALID [2022-02-20 14:18:39,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {29#true} is VALID [2022-02-20 14:18:39,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#true} assume !(~i~0 < 100); {29#true} is VALID [2022-02-20 14:18:39,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29#true} is VALID [2022-02-20 14:18:39,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#true} assume true; {29#true} is VALID [2022-02-20 14:18:39,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29#true} {30#false} #67#return; {30#false} is VALID [2022-02-20 14:18:39,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {30#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {30#false} is VALID [2022-02-20 14:18:39,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {30#false} assume !(main_~i~2#1 < 99); {30#false} is VALID [2022-02-20 14:18:39,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {30#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {30#false} is VALID [2022-02-20 14:18:39,055 INFO L272 TraceCheckUtils]: 19: Hoare triple {30#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {29#true} is VALID [2022-02-20 14:18:39,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {29#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {29#true} is VALID [2022-02-20 14:18:39,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {29#true} assume !(~i~0 < 100); {29#true} is VALID [2022-02-20 14:18:39,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {29#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {29#true} is VALID [2022-02-20 14:18:39,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {29#true} assume true; {29#true} is VALID [2022-02-20 14:18:39,057 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {29#true} {30#false} #69#return; {30#false} is VALID [2022-02-20 14:18:39,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {30#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {30#false} is VALID [2022-02-20 14:18:39,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {30#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {30#false} is VALID [2022-02-20 14:18:39,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 14:18:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:18:39,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:39,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272796697] [2022-02-20 14:18:39,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272796697] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:39,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761060543] [2022-02-20 14:18:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:39,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:39,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:39,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:18:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:39,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:18:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:39,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:39,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {29#true} is VALID [2022-02-20 14:18:39,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {54#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:39,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < 100); {30#false} is VALID [2022-02-20 14:18:39,343 INFO L272 TraceCheckUtils]: 3: Hoare triple {30#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {30#false} is VALID [2022-02-20 14:18:39,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {30#false} is VALID [2022-02-20 14:18:39,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !(~i~0 < 100); {30#false} is VALID [2022-02-20 14:18:39,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 14:18:39,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:18:39,348 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30#false} {30#false} #65#return; {30#false} is VALID [2022-02-20 14:18:39,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {30#false} is VALID [2022-02-20 14:18:39,349 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {30#false} is VALID [2022-02-20 14:18:39,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {30#false} is VALID [2022-02-20 14:18:39,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume !(~i~0 < 100); {30#false} is VALID [2022-02-20 14:18:39,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 14:18:39,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:18:39,357 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30#false} {30#false} #67#return; {30#false} is VALID [2022-02-20 14:18:39,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {30#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {30#false} is VALID [2022-02-20 14:18:39,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {30#false} assume !(main_~i~2#1 < 99); {30#false} is VALID [2022-02-20 14:18:39,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {30#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {30#false} is VALID [2022-02-20 14:18:39,358 INFO L272 TraceCheckUtils]: 19: Hoare triple {30#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {30#false} is VALID [2022-02-20 14:18:39,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {30#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {30#false} is VALID [2022-02-20 14:18:39,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {30#false} assume !(~i~0 < 100); {30#false} is VALID [2022-02-20 14:18:39,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {30#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 14:18:39,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:18:39,360 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {30#false} {30#false} #69#return; {30#false} is VALID [2022-02-20 14:18:39,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {30#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {30#false} is VALID [2022-02-20 14:18:39,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {30#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {30#false} is VALID [2022-02-20 14:18:39,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 14:18:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:18:39,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:18:39,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761060543] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:18:39,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:18:39,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:18:39,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330716014] [2022-02-20 14:18:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:18:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 14:18:39,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:39,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:18:39,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:39,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:18:39,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:18:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:18:39,442 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:18:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:39,527 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-02-20 14:18:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:18:39,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 14:18:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:18:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-20 14:18:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:18:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-20 14:18:39,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-02-20 14:18:39,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:39,645 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:18:39,645 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:18:39,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:18:39,652 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:39,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:18:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:18:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-02-20 14:18:39,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:39,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:39,682 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:39,683 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:39,690 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:18:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:18:39,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:39,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:39,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 14:18:39,692 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 14:18:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:39,698 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:18:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:18:39,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:39,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:39,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:39,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:18:39,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 28 [2022-02-20 14:18:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:39,706 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:18:39,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:18:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:18:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:18:39,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:39,710 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:39,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:39,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 14:18:39,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash -618478211, now seen corresponding path program 1 times [2022-02-20 14:18:39,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:39,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298362261] [2022-02-20 14:18:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 14:18:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {277#true} is VALID [2022-02-20 14:18:40,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume !(~i~0 < 100); {277#true} is VALID [2022-02-20 14:18:40,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {277#true} is VALID [2022-02-20 14:18:40,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 14:18:40,026 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {277#true} {278#false} #65#return; {278#false} is VALID [2022-02-20 14:18:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 14:18:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {277#true} is VALID [2022-02-20 14:18:40,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume !(~i~0 < 100); {277#true} is VALID [2022-02-20 14:18:40,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {277#true} is VALID [2022-02-20 14:18:40,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 14:18:40,038 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {277#true} {278#false} #67#return; {278#false} is VALID [2022-02-20 14:18:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 14:18:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {277#true} is VALID [2022-02-20 14:18:40,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume !(~i~0 < 100); {277#true} is VALID [2022-02-20 14:18:40,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {277#true} is VALID [2022-02-20 14:18:40,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 14:18:40,049 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {277#true} {278#false} #69#return; {278#false} is VALID [2022-02-20 14:18:40,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {277#true} is VALID [2022-02-20 14:18:40,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {279#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:40,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {279#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:40,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {279#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {280#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:40,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 100); {278#false} is VALID [2022-02-20 14:18:40,052 INFO L272 TraceCheckUtils]: 5: Hoare triple {278#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {277#true} is VALID [2022-02-20 14:18:40,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {277#true} is VALID [2022-02-20 14:18:40,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#true} assume !(~i~0 < 100); {277#true} is VALID [2022-02-20 14:18:40,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {277#true} is VALID [2022-02-20 14:18:40,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 14:18:40,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#true} {278#false} #65#return; {278#false} is VALID [2022-02-20 14:18:40,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {278#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {278#false} is VALID [2022-02-20 14:18:40,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {278#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {277#true} is VALID [2022-02-20 14:18:40,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {277#true} is VALID [2022-02-20 14:18:40,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {277#true} assume !(~i~0 < 100); {277#true} is VALID [2022-02-20 14:18:40,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {277#true} is VALID [2022-02-20 14:18:40,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 14:18:40,063 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {277#true} {278#false} #67#return; {278#false} is VALID [2022-02-20 14:18:40,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {278#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {278#false} is VALID [2022-02-20 14:18:40,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {278#false} assume !(main_~i~2#1 < 99); {278#false} is VALID [2022-02-20 14:18:40,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {278#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {278#false} is VALID [2022-02-20 14:18:40,065 INFO L272 TraceCheckUtils]: 21: Hoare triple {278#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {277#true} is VALID [2022-02-20 14:18:40,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {277#true} is VALID [2022-02-20 14:18:40,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {277#true} assume !(~i~0 < 100); {277#true} is VALID [2022-02-20 14:18:40,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {277#true} is VALID [2022-02-20 14:18:40,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 14:18:40,066 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {277#true} {278#false} #69#return; {278#false} is VALID [2022-02-20 14:18:40,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {278#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {278#false} is VALID [2022-02-20 14:18:40,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {278#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {278#false} is VALID [2022-02-20 14:18:40,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-02-20 14:18:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:18:40,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:40,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298362261] [2022-02-20 14:18:40,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298362261] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:40,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109460876] [2022-02-20 14:18:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:40,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:40,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:40,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:18:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:18:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:40,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {277#true} is VALID [2022-02-20 14:18:40,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {277#true} is VALID [2022-02-20 14:18:40,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {277#true} is VALID [2022-02-20 14:18:40,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {277#true} is VALID [2022-02-20 14:18:40,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#true} assume !(main_~i~1#1 < 100); {277#true} is VALID [2022-02-20 14:18:40,225 INFO L272 TraceCheckUtils]: 5: Hoare triple {277#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {277#true} is VALID [2022-02-20 14:18:40,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {317#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {317#(<= xor_~i~0 1)} assume !(~i~0 < 100); {278#false} is VALID [2022-02-20 14:18:40,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {278#false} is VALID [2022-02-20 14:18:40,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#false} assume true; {278#false} is VALID [2022-02-20 14:18:40,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {278#false} {277#true} #65#return; {278#false} is VALID [2022-02-20 14:18:40,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {278#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {278#false} is VALID [2022-02-20 14:18:40,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {278#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {278#false} is VALID [2022-02-20 14:18:40,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {278#false} is VALID [2022-02-20 14:18:40,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {278#false} assume !(~i~0 < 100); {278#false} is VALID [2022-02-20 14:18:40,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {278#false} is VALID [2022-02-20 14:18:40,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {278#false} assume true; {278#false} is VALID [2022-02-20 14:18:40,229 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {278#false} {278#false} #67#return; {278#false} is VALID [2022-02-20 14:18:40,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {278#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {278#false} is VALID [2022-02-20 14:18:40,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {278#false} assume !(main_~i~2#1 < 99); {278#false} is VALID [2022-02-20 14:18:40,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {278#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {278#false} is VALID [2022-02-20 14:18:40,230 INFO L272 TraceCheckUtils]: 21: Hoare triple {278#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {278#false} is VALID [2022-02-20 14:18:40,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {278#false} is VALID [2022-02-20 14:18:40,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {278#false} assume !(~i~0 < 100); {278#false} is VALID [2022-02-20 14:18:40,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {278#false} is VALID [2022-02-20 14:18:40,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {278#false} assume true; {278#false} is VALID [2022-02-20 14:18:40,231 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {278#false} {278#false} #69#return; {278#false} is VALID [2022-02-20 14:18:40,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {278#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {278#false} is VALID [2022-02-20 14:18:40,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {278#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {278#false} is VALID [2022-02-20 14:18:40,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-02-20 14:18:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:18:40,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:18:40,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109460876] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:18:40,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:18:40,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:18:40,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114894386] [2022-02-20 14:18:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:18:40,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 14:18:40,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:40,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:40,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:40,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:18:40,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:18:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:18:40,256 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:40,294 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-02-20 14:18:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:18:40,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 14:18:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-20 14:18:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-20 14:18:40,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-02-20 14:18:40,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:40,342 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:18:40,342 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:18:40,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:18:40,344 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:40,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:18:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:18:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-20 14:18:40,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:40,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:40,350 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:40,350 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:40,352 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 14:18:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 14:18:40,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:40,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:40,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-02-20 14:18:40,353 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-02-20 14:18:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:40,355 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 14:18:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 14:18:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:40,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:40,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:40,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-20 14:18:40,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2022-02-20 14:18:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:40,359 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-20 14:18:40,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:18:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 14:18:40,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:40,360 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:40,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:40,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 14:18:40,584 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1511029509, now seen corresponding path program 1 times [2022-02-20 14:18:40,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:40,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208075058] [2022-02-20 14:18:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 14:18:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {551#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:40,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {551#(<= xor_~i~0 2)} assume !(~i~0 < 100); {526#false} is VALID [2022-02-20 14:18:40,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {526#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {526#false} is VALID [2022-02-20 14:18:40,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#false} assume true; {526#false} is VALID [2022-02-20 14:18:40,675 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {526#false} {526#false} #65#return; {526#false} is VALID [2022-02-20 14:18:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 14:18:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {525#true} is VALID [2022-02-20 14:18:40,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {525#true} is VALID [2022-02-20 14:18:40,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {525#true} is VALID [2022-02-20 14:18:40,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {525#true} assume !(~i~0 < 100); {525#true} is VALID [2022-02-20 14:18:40,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {525#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {525#true} is VALID [2022-02-20 14:18:40,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#true} assume true; {525#true} is VALID [2022-02-20 14:18:40,703 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {525#true} {526#false} #67#return; {526#false} is VALID [2022-02-20 14:18:40,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 14:18:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {551#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:40,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {551#(<= xor_~i~0 2)} assume !(~i~0 < 100); {526#false} is VALID [2022-02-20 14:18:40,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {526#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {526#false} is VALID [2022-02-20 14:18:40,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#false} assume true; {526#false} is VALID [2022-02-20 14:18:40,725 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {526#false} {526#false} #69#return; {526#false} is VALID [2022-02-20 14:18:40,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {525#true} is VALID [2022-02-20 14:18:40,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {527#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:40,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {527#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:40,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {528#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:40,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {528#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 100); {526#false} is VALID [2022-02-20 14:18:40,727 INFO L272 TraceCheckUtils]: 5: Hoare triple {526#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {525#true} is VALID [2022-02-20 14:18:40,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {551#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:40,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(<= xor_~i~0 2)} assume !(~i~0 < 100); {526#false} is VALID [2022-02-20 14:18:40,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {526#false} is VALID [2022-02-20 14:18:40,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {526#false} assume true; {526#false} is VALID [2022-02-20 14:18:40,730 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {526#false} {526#false} #65#return; {526#false} is VALID [2022-02-20 14:18:40,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {526#false} is VALID [2022-02-20 14:18:40,730 INFO L272 TraceCheckUtils]: 14: Hoare triple {526#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {525#true} is VALID [2022-02-20 14:18:40,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {525#true} is VALID [2022-02-20 14:18:40,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {525#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {525#true} is VALID [2022-02-20 14:18:40,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {525#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {525#true} is VALID [2022-02-20 14:18:40,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#true} assume !(~i~0 < 100); {525#true} is VALID [2022-02-20 14:18:40,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {525#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {525#true} is VALID [2022-02-20 14:18:40,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {525#true} assume true; {525#true} is VALID [2022-02-20 14:18:40,732 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {525#true} {526#false} #67#return; {526#false} is VALID [2022-02-20 14:18:40,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {526#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {526#false} is VALID [2022-02-20 14:18:40,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#false} assume !(main_~i~2#1 < 99); {526#false} is VALID [2022-02-20 14:18:40,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {526#false} is VALID [2022-02-20 14:18:40,733 INFO L272 TraceCheckUtils]: 25: Hoare triple {526#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {525#true} is VALID [2022-02-20 14:18:40,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {550#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {550#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:40,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {550#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {551#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:40,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {551#(<= xor_~i~0 2)} assume !(~i~0 < 100); {526#false} is VALID [2022-02-20 14:18:40,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {526#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {526#false} is VALID [2022-02-20 14:18:40,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {526#false} assume true; {526#false} is VALID [2022-02-20 14:18:40,735 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {526#false} {526#false} #69#return; {526#false} is VALID [2022-02-20 14:18:40,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {526#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {526#false} is VALID [2022-02-20 14:18:40,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {526#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {526#false} is VALID [2022-02-20 14:18:40,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {526#false} assume !false; {526#false} is VALID [2022-02-20 14:18:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:18:40,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:40,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208075058] [2022-02-20 14:18:40,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208075058] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:40,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354008795] [2022-02-20 14:18:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:40,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:40,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:40,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:18:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:18:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:40,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {525#true} is VALID [2022-02-20 14:18:40,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {525#true} is VALID [2022-02-20 14:18:40,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {525#true} is VALID [2022-02-20 14:18:40,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {525#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {525#true} is VALID [2022-02-20 14:18:40,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {525#true} assume !(main_~i~1#1 < 100); {525#true} is VALID [2022-02-20 14:18:40,954 INFO L272 TraceCheckUtils]: 5: Hoare triple {525#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {525#true} is VALID [2022-02-20 14:18:40,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {525#true} is VALID [2022-02-20 14:18:40,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {525#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {525#true} is VALID [2022-02-20 14:18:40,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {525#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {525#true} is VALID [2022-02-20 14:18:40,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {525#true} assume !(~i~0 < 100); {525#true} is VALID [2022-02-20 14:18:40,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {525#true} is VALID [2022-02-20 14:18:40,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {525#true} assume true; {525#true} is VALID [2022-02-20 14:18:40,955 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {525#true} {525#true} #65#return; {525#true} is VALID [2022-02-20 14:18:40,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {525#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {525#true} is VALID [2022-02-20 14:18:40,956 INFO L272 TraceCheckUtils]: 14: Hoare triple {525#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {525#true} is VALID [2022-02-20 14:18:40,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {525#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {525#true} is VALID [2022-02-20 14:18:40,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {525#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {525#true} is VALID [2022-02-20 14:18:40,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {525#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {525#true} is VALID [2022-02-20 14:18:40,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#true} assume !(~i~0 < 100); {525#true} is VALID [2022-02-20 14:18:40,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {525#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {525#true} is VALID [2022-02-20 14:18:40,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {525#true} assume true; {525#true} is VALID [2022-02-20 14:18:40,957 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {525#true} {525#true} #67#return; {525#true} is VALID [2022-02-20 14:18:40,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {525#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {621#(<= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:18:40,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {621#(<= |ULTIMATE.start_main_~i~2#1| 0)} assume !(main_~i~2#1 < 99); {526#false} is VALID [2022-02-20 14:18:40,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {526#false} is VALID [2022-02-20 14:18:40,959 INFO L272 TraceCheckUtils]: 25: Hoare triple {526#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {526#false} is VALID [2022-02-20 14:18:40,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {526#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {526#false} is VALID [2022-02-20 14:18:40,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {526#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {526#false} is VALID [2022-02-20 14:18:40,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {526#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {526#false} is VALID [2022-02-20 14:18:40,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {526#false} assume !(~i~0 < 100); {526#false} is VALID [2022-02-20 14:18:40,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {526#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {526#false} is VALID [2022-02-20 14:18:40,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {526#false} assume true; {526#false} is VALID [2022-02-20 14:18:40,960 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {526#false} {526#false} #69#return; {526#false} is VALID [2022-02-20 14:18:40,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {526#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {526#false} is VALID [2022-02-20 14:18:40,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {526#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {526#false} is VALID [2022-02-20 14:18:40,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {526#false} assume !false; {526#false} is VALID [2022-02-20 14:18:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:18:40,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:18:40,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354008795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:18:40,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:18:40,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-02-20 14:18:40,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652049738] [2022-02-20 14:18:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:18:40,963 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-20 14:18:40,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:40,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:40,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:40,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:18:40,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:40,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:18:40,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:18:40,990 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:41,041 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 14:18:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:18:41,042 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-20 14:18:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-20 14:18:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-20 14:18:41,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-02-20 14:18:41,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:41,090 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:18:41,090 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:18:41,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:18:41,093 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:41,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:18:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:18:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-20 14:18:41,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:41,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:41,104 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:41,104 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:41,107 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 14:18:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 14:18:41,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:41,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:41,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 14:18:41,110 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 14:18:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:41,116 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 14:18:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 14:18:41,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:41,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:41,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:41,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 14:18:41,121 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 36 [2022-02-20 14:18:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:41,121 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 14:18:41,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:18:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 14:18:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:18:41,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:41,125 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:41,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:41,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:41,343 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1553738215, now seen corresponding path program 1 times [2022-02-20 14:18:41,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:41,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128197183] [2022-02-20 14:18:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 14:18:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:41,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {826#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:41,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {826#(<= xor_~i~0 2)} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,437 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {801#false} {801#false} #65#return; {801#false} is VALID [2022-02-20 14:18:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 14:18:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:41,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {800#true} is VALID [2022-02-20 14:18:41,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {800#true} is VALID [2022-02-20 14:18:41,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {800#true} is VALID [2022-02-20 14:18:41,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#true} assume !(~i~0 < 100); {800#true} is VALID [2022-02-20 14:18:41,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#true} is VALID [2022-02-20 14:18:41,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 14:18:41,459 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {800#true} {801#false} #67#return; {801#false} is VALID [2022-02-20 14:18:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 14:18:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:41,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {826#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:41,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {826#(<= xor_~i~0 2)} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,480 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {801#false} {801#false} #69#return; {801#false} is VALID [2022-02-20 14:18:41,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {800#true} is VALID [2022-02-20 14:18:41,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {802#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:41,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {802#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:41,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {802#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {803#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:41,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {803#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 100); {801#false} is VALID [2022-02-20 14:18:41,483 INFO L272 TraceCheckUtils]: 5: Hoare triple {801#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {800#true} is VALID [2022-02-20 14:18:41,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {825#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {825#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {826#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:41,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#(<= xor_~i~0 2)} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,485 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {801#false} {801#false} #65#return; {801#false} is VALID [2022-02-20 14:18:41,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {801#false} is VALID [2022-02-20 14:18:41,485 INFO L272 TraceCheckUtils]: 14: Hoare triple {801#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {800#true} is VALID [2022-02-20 14:18:41,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {800#true} is VALID [2022-02-20 14:18:41,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {800#true} is VALID [2022-02-20 14:18:41,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {800#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {800#true} is VALID [2022-02-20 14:18:41,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {800#true} assume !(~i~0 < 100); {800#true} is VALID [2022-02-20 14:18:41,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#true} is VALID [2022-02-20 14:18:41,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 14:18:41,487 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {800#true} {801#false} #67#return; {801#false} is VALID [2022-02-20 14:18:41,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {801#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {801#false} is VALID [2022-02-20 14:18:41,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {801#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {801#false} is VALID [2022-02-20 14:18:41,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {801#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {801#false} is VALID [2022-02-20 14:18:41,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {801#false} assume !(main_~i~2#1 < 99); {801#false} is VALID [2022-02-20 14:18:41,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {801#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {801#false} is VALID [2022-02-20 14:18:41,488 INFO L272 TraceCheckUtils]: 27: Hoare triple {801#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {800#true} is VALID [2022-02-20 14:18:41,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {825#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {825#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:41,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {825#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {826#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:41,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {826#(<= xor_~i~0 2)} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,490 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {801#false} {801#false} #69#return; {801#false} is VALID [2022-02-20 14:18:41,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {801#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {801#false} is VALID [2022-02-20 14:18:41,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {801#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {801#false} is VALID [2022-02-20 14:18:41,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 14:18:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 14:18:41,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:41,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128197183] [2022-02-20 14:18:41,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128197183] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:41,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352405712] [2022-02-20 14:18:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:41,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:41,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:41,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:41,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:18:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:41,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:18:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:41,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:41,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {800#true} is VALID [2022-02-20 14:18:41,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {833#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:41,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {833#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:41,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {803#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:41,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {803#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 100); {801#false} is VALID [2022-02-20 14:18:41,712 INFO L272 TraceCheckUtils]: 5: Hoare triple {801#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {801#false} is VALID [2022-02-20 14:18:41,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {801#false} is VALID [2022-02-20 14:18:41,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {801#false} is VALID [2022-02-20 14:18:41,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {801#false} is VALID [2022-02-20 14:18:41,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#false} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,714 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {801#false} {801#false} #65#return; {801#false} is VALID [2022-02-20 14:18:41,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {801#false} is VALID [2022-02-20 14:18:41,715 INFO L272 TraceCheckUtils]: 14: Hoare triple {801#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {801#false} is VALID [2022-02-20 14:18:41,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {801#false} is VALID [2022-02-20 14:18:41,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {801#false} is VALID [2022-02-20 14:18:41,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {801#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {801#false} is VALID [2022-02-20 14:18:41,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {801#false} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,716 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {801#false} {801#false} #67#return; {801#false} is VALID [2022-02-20 14:18:41,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {801#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {801#false} is VALID [2022-02-20 14:18:41,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {801#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {801#false} is VALID [2022-02-20 14:18:41,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {801#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {801#false} is VALID [2022-02-20 14:18:41,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {801#false} assume !(main_~i~2#1 < 99); {801#false} is VALID [2022-02-20 14:18:41,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {801#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {801#false} is VALID [2022-02-20 14:18:41,719 INFO L272 TraceCheckUtils]: 27: Hoare triple {801#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {801#false} is VALID [2022-02-20 14:18:41,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {801#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {801#false} is VALID [2022-02-20 14:18:41,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {801#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {801#false} is VALID [2022-02-20 14:18:41,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {801#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {801#false} is VALID [2022-02-20 14:18:41,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {801#false} assume !(~i~0 < 100); {801#false} is VALID [2022-02-20 14:18:41,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {801#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {801#false} is VALID [2022-02-20 14:18:41,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {801#false} assume true; {801#false} is VALID [2022-02-20 14:18:41,720 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {801#false} {801#false} #69#return; {801#false} is VALID [2022-02-20 14:18:41,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {801#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {801#false} is VALID [2022-02-20 14:18:41,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {801#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {801#false} is VALID [2022-02-20 14:18:41,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 14:18:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 14:18:41,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:41,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 14:18:41,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {801#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {801#false} is VALID [2022-02-20 14:18:41,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {801#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {801#false} is VALID [2022-02-20 14:18:41,857 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {800#true} {801#false} #69#return; {801#false} is VALID [2022-02-20 14:18:41,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 14:18:41,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {800#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#true} is VALID [2022-02-20 14:18:41,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {800#true} assume !(~i~0 < 100); {800#true} is VALID [2022-02-20 14:18:41,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {800#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {800#true} is VALID [2022-02-20 14:18:41,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {800#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {800#true} is VALID [2022-02-20 14:18:41,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {800#true} is VALID [2022-02-20 14:18:41,858 INFO L272 TraceCheckUtils]: 27: Hoare triple {801#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {800#true} is VALID [2022-02-20 14:18:41,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {801#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {801#false} is VALID [2022-02-20 14:18:41,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {801#false} assume !(main_~i~2#1 < 99); {801#false} is VALID [2022-02-20 14:18:41,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {801#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {801#false} is VALID [2022-02-20 14:18:41,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {801#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {801#false} is VALID [2022-02-20 14:18:41,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {801#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {801#false} is VALID [2022-02-20 14:18:41,860 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {800#true} {801#false} #67#return; {801#false} is VALID [2022-02-20 14:18:41,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 14:18:41,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#true} is VALID [2022-02-20 14:18:41,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {800#true} assume !(~i~0 < 100); {800#true} is VALID [2022-02-20 14:18:41,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {800#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {800#true} is VALID [2022-02-20 14:18:41,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {800#true} is VALID [2022-02-20 14:18:41,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {800#true} is VALID [2022-02-20 14:18:41,861 INFO L272 TraceCheckUtils]: 14: Hoare triple {801#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {800#true} is VALID [2022-02-20 14:18:41,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {801#false} is VALID [2022-02-20 14:18:41,861 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {800#true} {801#false} #65#return; {801#false} is VALID [2022-02-20 14:18:41,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 14:18:41,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#true} is VALID [2022-02-20 14:18:41,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {800#true} assume !(~i~0 < 100); {800#true} is VALID [2022-02-20 14:18:41,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {800#true} is VALID [2022-02-20 14:18:41,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {800#true} is VALID [2022-02-20 14:18:41,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {800#true} is VALID [2022-02-20 14:18:41,868 INFO L272 TraceCheckUtils]: 5: Hoare triple {801#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {800#true} is VALID [2022-02-20 14:18:41,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {1041#(< |ULTIMATE.start_main_~i~1#1| 100)} assume !(main_~i~1#1 < 100); {801#false} is VALID [2022-02-20 14:18:41,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#(< |ULTIMATE.start_main_~i~1#1| 99)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1041#(< |ULTIMATE.start_main_~i~1#1| 100)} is VALID [2022-02-20 14:18:41,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#(< |ULTIMATE.start_main_~i~1#1| 99)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1045#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:41,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1045#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:41,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {800#true} is VALID [2022-02-20 14:18:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 14:18:41,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352405712] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:41,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:41,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-02-20 14:18:41,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231117378] [2022-02-20 14:18:41,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-02-20 14:18:41,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:41,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:41,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:41,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:18:41,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:18:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:18:41,922 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:42,055 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-02-20 14:18:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:18:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-02-20 14:18:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-02-20 14:18:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-02-20 14:18:42,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-02-20 14:18:42,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:42,124 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:18:42,124 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:18:42,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:18:42,126 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:42,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:18:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:18:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-02-20 14:18:42,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:42,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:42,134 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:42,135 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:42,136 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 14:18:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-20 14:18:42,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:42,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:42,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-02-20 14:18:42,137 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-02-20 14:18:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:42,139 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 14:18:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-20 14:18:42,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:42,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:42,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:42,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-02-20 14:18:42,142 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2022-02-20 14:18:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:42,142 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-02-20 14:18:42,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 14:18:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 14:18:42,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:42,143 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:42,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:42,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:42,359 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:42,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1124150243, now seen corresponding path program 2 times [2022-02-20 14:18:42,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:42,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941783680] [2022-02-20 14:18:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 14:18:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:42,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,443 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1245#true} {1245#true} #65#return; {1245#true} is VALID [2022-02-20 14:18:42,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 14:18:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:42,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,453 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1245#true} {1245#true} #67#return; {1245#true} is VALID [2022-02-20 14:18:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 14:18:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:42,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,465 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1245#true} {1246#false} #69#return; {1246#false} is VALID [2022-02-20 14:18:42,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {1245#true} is VALID [2022-02-20 14:18:42,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1245#true} is VALID [2022-02-20 14:18:42,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1245#true} is VALID [2022-02-20 14:18:42,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {1245#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1245#true} is VALID [2022-02-20 14:18:42,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {1245#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1245#true} is VALID [2022-02-20 14:18:42,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1245#true} is VALID [2022-02-20 14:18:42,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1245#true} is VALID [2022-02-20 14:18:42,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1245#true} is VALID [2022-02-20 14:18:42,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {1245#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1245#true} is VALID [2022-02-20 14:18:42,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {1245#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1245#true} is VALID [2022-02-20 14:18:42,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {1245#true} assume !(main_~i~1#1 < 100); {1245#true} is VALID [2022-02-20 14:18:42,467 INFO L272 TraceCheckUtils]: 11: Hoare triple {1245#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1245#true} is VALID [2022-02-20 14:18:42,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,468 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1245#true} {1245#true} #65#return; {1245#true} is VALID [2022-02-20 14:18:42,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {1245#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {1245#true} is VALID [2022-02-20 14:18:42,469 INFO L272 TraceCheckUtils]: 22: Hoare triple {1245#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1245#true} is VALID [2022-02-20 14:18:42,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,470 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1245#true} {1245#true} #67#return; {1245#true} is VALID [2022-02-20 14:18:42,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {1245#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {1265#(= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:18:42,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {1265#(= |ULTIMATE.start_main_~i~2#1| 0)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1265#(= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:18:42,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {1265#(= |ULTIMATE.start_main_~i~2#1| 0)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1266#(<= |ULTIMATE.start_main_~i~2#1| 1)} is VALID [2022-02-20 14:18:42,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {1266#(<= |ULTIMATE.start_main_~i~2#1| 1)} assume !(main_~i~2#1 < 99); {1246#false} is VALID [2022-02-20 14:18:42,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {1246#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {1246#false} is VALID [2022-02-20 14:18:42,472 INFO L272 TraceCheckUtils]: 37: Hoare triple {1246#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1245#true} is VALID [2022-02-20 14:18:42,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,474 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1245#true} {1246#false} #69#return; {1246#false} is VALID [2022-02-20 14:18:42,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {1246#false} is VALID [2022-02-20 14:18:42,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {1246#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {1246#false} is VALID [2022-02-20 14:18:42,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {1246#false} assume !false; {1246#false} is VALID [2022-02-20 14:18:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-20 14:18:42,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:42,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941783680] [2022-02-20 14:18:42,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941783680] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:42,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584540047] [2022-02-20 14:18:42,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:18:42,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:42,477 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:42,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:18:42,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:18:42,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:18:42,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:18:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:42,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:42,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {1245#true} is VALID [2022-02-20 14:18:42,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1282#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:42,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {1282#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1282#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:42,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {1282#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1289#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:42,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {1289#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1289#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:42,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1289#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1296#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:42,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1296#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:42,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {1296#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1303#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:42,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1303#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:42,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1310#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:42,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {1310#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_~i~1#1 < 100); {1246#false} is VALID [2022-02-20 14:18:42,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {1246#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1246#false} is VALID [2022-02-20 14:18:42,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {1246#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1246#false} is VALID [2022-02-20 14:18:42,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {1246#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1246#false} is VALID [2022-02-20 14:18:42,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {1246#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1246#false} is VALID [2022-02-20 14:18:42,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {1246#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1246#false} is VALID [2022-02-20 14:18:42,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {1246#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1246#false} is VALID [2022-02-20 14:18:42,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {1246#false} assume !(~i~0 < 100); {1246#false} is VALID [2022-02-20 14:18:42,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {1246#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1246#false} is VALID [2022-02-20 14:18:42,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {1246#false} assume true; {1246#false} is VALID [2022-02-20 14:18:42,745 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1246#false} {1246#false} #65#return; {1246#false} is VALID [2022-02-20 14:18:42,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {1246#false} is VALID [2022-02-20 14:18:42,745 INFO L272 TraceCheckUtils]: 22: Hoare triple {1246#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1246#false} is VALID [2022-02-20 14:18:42,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {1246#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1246#false} is VALID [2022-02-20 14:18:42,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {1246#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1246#false} is VALID [2022-02-20 14:18:42,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {1246#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1246#false} is VALID [2022-02-20 14:18:42,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {1246#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1246#false} is VALID [2022-02-20 14:18:42,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {1246#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1246#false} is VALID [2022-02-20 14:18:42,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {1246#false} assume !(~i~0 < 100); {1246#false} is VALID [2022-02-20 14:18:42,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {1246#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1246#false} is VALID [2022-02-20 14:18:42,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {1246#false} assume true; {1246#false} is VALID [2022-02-20 14:18:42,747 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1246#false} {1246#false} #67#return; {1246#false} is VALID [2022-02-20 14:18:42,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {1246#false} is VALID [2022-02-20 14:18:42,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {1246#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1246#false} is VALID [2022-02-20 14:18:42,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {1246#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1246#false} is VALID [2022-02-20 14:18:42,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {1246#false} assume !(main_~i~2#1 < 99); {1246#false} is VALID [2022-02-20 14:18:42,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {1246#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {1246#false} is VALID [2022-02-20 14:18:42,748 INFO L272 TraceCheckUtils]: 37: Hoare triple {1246#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1246#false} is VALID [2022-02-20 14:18:42,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {1246#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1246#false} is VALID [2022-02-20 14:18:42,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {1246#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1246#false} is VALID [2022-02-20 14:18:42,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {1246#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1246#false} is VALID [2022-02-20 14:18:42,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {1246#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1246#false} is VALID [2022-02-20 14:18:42,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {1246#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1246#false} is VALID [2022-02-20 14:18:42,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {1246#false} assume !(~i~0 < 100); {1246#false} is VALID [2022-02-20 14:18:42,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {1246#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1246#false} is VALID [2022-02-20 14:18:42,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {1246#false} assume true; {1246#false} is VALID [2022-02-20 14:18:42,750 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1246#false} {1246#false} #69#return; {1246#false} is VALID [2022-02-20 14:18:42,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {1246#false} is VALID [2022-02-20 14:18:42,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {1246#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {1246#false} is VALID [2022-02-20 14:18:42,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {1246#false} assume !false; {1246#false} is VALID [2022-02-20 14:18:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-20 14:18:42,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:42,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {1246#false} assume !false; {1246#false} is VALID [2022-02-20 14:18:42,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {1246#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {1246#false} is VALID [2022-02-20 14:18:42,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {1246#false} is VALID [2022-02-20 14:18:42,941 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1245#true} {1246#false} #69#return; {1246#false} is VALID [2022-02-20 14:18:42,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,945 INFO L272 TraceCheckUtils]: 37: Hoare triple {1246#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1245#true} is VALID [2022-02-20 14:18:42,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {1246#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {1246#false} is VALID [2022-02-20 14:18:42,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {1246#false} assume !(main_~i~2#1 < 99); {1246#false} is VALID [2022-02-20 14:18:42,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {1246#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1246#false} is VALID [2022-02-20 14:18:42,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {1246#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1246#false} is VALID [2022-02-20 14:18:42,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {1246#false} is VALID [2022-02-20 14:18:42,946 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1245#true} {1246#false} #67#return; {1246#false} is VALID [2022-02-20 14:18:42,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,947 INFO L272 TraceCheckUtils]: 22: Hoare triple {1246#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1245#true} is VALID [2022-02-20 14:18:42,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {1246#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {1246#false} is VALID [2022-02-20 14:18:42,948 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1245#true} {1246#false} #65#return; {1246#false} is VALID [2022-02-20 14:18:42,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-02-20 14:18:42,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {1245#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1245#true} is VALID [2022-02-20 14:18:42,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {1245#true} assume !(~i~0 < 100); {1245#true} is VALID [2022-02-20 14:18:42,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1245#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1245#true} is VALID [2022-02-20 14:18:42,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1245#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1245#true} is VALID [2022-02-20 14:18:42,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1245#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1245#true} is VALID [2022-02-20 14:18:42,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {1246#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1245#true} is VALID [2022-02-20 14:18:42,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#(< |ULTIMATE.start_main_~i~1#1| 100)} assume !(main_~i~1#1 < 100); {1246#false} is VALID [2022-02-20 14:18:42,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#(< |ULTIMATE.start_main_~i~1#1| 99)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1548#(< |ULTIMATE.start_main_~i~1#1| 100)} is VALID [2022-02-20 14:18:42,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1552#(< |ULTIMATE.start_main_~i~1#1| 99)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1552#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:42,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1559#(< |ULTIMATE.start_main_~i~1#1| 98)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1552#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:42,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1559#(< |ULTIMATE.start_main_~i~1#1| 98)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1559#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:18:42,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#(< |ULTIMATE.start_main_~i~1#1| 97)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1559#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:18:42,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {1566#(< |ULTIMATE.start_main_~i~1#1| 97)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1566#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:18:42,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {1573#(< |ULTIMATE.start_main_~i~1#1| 96)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1566#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:18:42,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1573#(< |ULTIMATE.start_main_~i~1#1| 96)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1573#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:18:42,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1573#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:18:42,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {1245#true} is VALID [2022-02-20 14:18:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-20 14:18:42,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584540047] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:42,954 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:42,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:18:42,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487619929] [2022-02-20 14:18:42,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-02-20 14:18:42,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:42,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 14:18:43,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:43,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:18:43,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:18:43,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:18:43,008 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 14:18:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:43,169 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-02-20 14:18:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:18:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-02-20 14:18:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 14:18:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-02-20 14:18:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 14:18:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-02-20 14:18:43,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 77 transitions. [2022-02-20 14:18:43,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:43,233 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:18:43,233 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 14:18:43,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:18:43,234 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:43,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:18:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 14:18:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-02-20 14:18:43,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:43,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:43,249 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:43,249 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:43,251 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-02-20 14:18:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-20 14:18:43,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:43,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:43,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 48 states. [2022-02-20 14:18:43,252 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 48 states. [2022-02-20 14:18:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:43,254 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-02-20 14:18:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-20 14:18:43,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:43,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:43,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:43,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-02-20 14:18:43,256 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 50 [2022-02-20 14:18:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:43,257 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-02-20 14:18:43,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 14:18:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-02-20 14:18:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 14:18:43,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:43,258 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:43,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 14:18:43,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:43,471 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1238744391, now seen corresponding path program 3 times [2022-02-20 14:18:43,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:43,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778868410] [2022-02-20 14:18:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 14:18:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:43,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1875#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:43,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {1875#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1875#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:43,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1875#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1876#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:43,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {1876#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1876#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:43,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {1876#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1877#(<= xor_~i~0 3)} is VALID [2022-02-20 14:18:43,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {1877#(<= xor_~i~0 3)} assume !(~i~0 < 100); {1847#false} is VALID [2022-02-20 14:18:43,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1847#false} is VALID [2022-02-20 14:18:43,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#false} assume true; {1847#false} is VALID [2022-02-20 14:18:43,611 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1847#false} {1846#true} #65#return; {1847#false} is VALID [2022-02-20 14:18:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 14:18:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:43,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:43,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:43,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:43,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:43,623 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1846#true} {1847#false} #67#return; {1847#false} is VALID [2022-02-20 14:18:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 14:18:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:43,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:43,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:43,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:43,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:43,641 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1846#true} {1847#false} #69#return; {1847#false} is VALID [2022-02-20 14:18:43,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {1846#true} is VALID [2022-02-20 14:18:43,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {1846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1846#true} is VALID [2022-02-20 14:18:43,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {1846#true} assume !(main_~i~1#1 < 100); {1846#true} is VALID [2022-02-20 14:18:43,643 INFO L272 TraceCheckUtils]: 23: Hoare triple {1846#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:43,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1875#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:43,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {1875#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1875#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:43,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {1875#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1876#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:43,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {1876#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1876#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:43,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {1876#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1877#(<= xor_~i~0 3)} is VALID [2022-02-20 14:18:43,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(<= xor_~i~0 3)} assume !(~i~0 < 100); {1847#false} is VALID [2022-02-20 14:18:43,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {1847#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1847#false} is VALID [2022-02-20 14:18:43,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {1847#false} assume true; {1847#false} is VALID [2022-02-20 14:18:43,646 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1847#false} {1846#true} #65#return; {1847#false} is VALID [2022-02-20 14:18:43,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {1847#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {1847#false} is VALID [2022-02-20 14:18:43,647 INFO L272 TraceCheckUtils]: 34: Hoare triple {1847#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:43,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:43,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:43,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:43,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:43,648 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1846#true} {1847#false} #67#return; {1847#false} is VALID [2022-02-20 14:18:43,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {1847#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {1847#false} is VALID [2022-02-20 14:18:43,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {1847#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1847#false} is VALID [2022-02-20 14:18:43,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {1847#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1847#false} is VALID [2022-02-20 14:18:43,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {1847#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1847#false} is VALID [2022-02-20 14:18:43,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {1847#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1847#false} is VALID [2022-02-20 14:18:43,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {1847#false} assume !(main_~i~2#1 < 99); {1847#false} is VALID [2022-02-20 14:18:43,649 INFO L290 TraceCheckUtils]: 50: Hoare triple {1847#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {1847#false} is VALID [2022-02-20 14:18:43,650 INFO L272 TraceCheckUtils]: 51: Hoare triple {1847#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:43,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:43,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,650 INFO L290 TraceCheckUtils]: 54: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,650 INFO L290 TraceCheckUtils]: 55: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,650 INFO L290 TraceCheckUtils]: 56: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:43,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:43,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:43,651 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {1846#true} {1847#false} #69#return; {1847#false} is VALID [2022-02-20 14:18:43,651 INFO L290 TraceCheckUtils]: 61: Hoare triple {1847#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {1847#false} is VALID [2022-02-20 14:18:43,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {1847#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {1847#false} is VALID [2022-02-20 14:18:43,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 14:18:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-02-20 14:18:43,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:43,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778868410] [2022-02-20 14:18:43,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778868410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:43,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977202895] [2022-02-20 14:18:43,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:18:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:43,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:43,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:18:43,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:18:43,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:18:43,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:18:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:43,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:43,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {1846#true} is VALID [2022-02-20 14:18:43,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1846#true} is VALID [2022-02-20 14:18:43,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:43,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:43,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {1846#true} assume !(main_~i~1#1 < 100); {1846#true} is VALID [2022-02-20 14:18:43,911 INFO L272 TraceCheckUtils]: 23: Hoare triple {1846#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:43,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:43,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:43,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:43,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:43,913 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1846#true} {1846#true} #65#return; {1846#true} is VALID [2022-02-20 14:18:43,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {1846#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {1846#true} is VALID [2022-02-20 14:18:43,913 INFO L272 TraceCheckUtils]: 34: Hoare triple {1846#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:43,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:43,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:43,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:43,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:43,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:43,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:43,914 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1846#true} {1846#true} #67#return; {1846#true} is VALID [2022-02-20 14:18:43,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {1846#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {1846#true} is VALID [2022-02-20 14:18:43,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {1846#true} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1846#true} is VALID [2022-02-20 14:18:43,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {1846#true} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1846#true} is VALID [2022-02-20 14:18:43,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {1846#true} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1846#true} is VALID [2022-02-20 14:18:43,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {1846#true} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1846#true} is VALID [2022-02-20 14:18:43,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {1846#true} assume !(main_~i~2#1 < 99); {1846#true} is VALID [2022-02-20 14:18:43,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {1846#true} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {1846#true} is VALID [2022-02-20 14:18:43,916 INFO L272 TraceCheckUtils]: 51: Hoare triple {1846#true} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:43,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1875#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:43,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {1875#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1875#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:43,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {1875#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1876#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:43,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {1876#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1876#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:43,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {1876#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1877#(<= xor_~i~0 3)} is VALID [2022-02-20 14:18:43,918 INFO L290 TraceCheckUtils]: 57: Hoare triple {1877#(<= xor_~i~0 3)} assume !(~i~0 < 100); {1847#false} is VALID [2022-02-20 14:18:43,919 INFO L290 TraceCheckUtils]: 58: Hoare triple {1847#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1847#false} is VALID [2022-02-20 14:18:43,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {1847#false} assume true; {1847#false} is VALID [2022-02-20 14:18:43,919 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {1847#false} {1846#true} #69#return; {1847#false} is VALID [2022-02-20 14:18:43,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {1847#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {1847#false} is VALID [2022-02-20 14:18:43,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {1847#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {1847#false} is VALID [2022-02-20 14:18:43,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 14:18:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-02-20 14:18:43,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:44,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 14:18:44,099 INFO L290 TraceCheckUtils]: 62: Hoare triple {1847#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {1847#false} is VALID [2022-02-20 14:18:44,099 INFO L290 TraceCheckUtils]: 61: Hoare triple {1847#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {1847#false} is VALID [2022-02-20 14:18:44,099 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {1847#false} {1846#true} #69#return; {1847#false} is VALID [2022-02-20 14:18:44,100 INFO L290 TraceCheckUtils]: 59: Hoare triple {1847#false} assume true; {1847#false} is VALID [2022-02-20 14:18:44,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {1847#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1847#false} is VALID [2022-02-20 14:18:44,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {2091#(< xor_~i~0 100)} assume !(~i~0 < 100); {1847#false} is VALID [2022-02-20 14:18:44,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {2095#(< xor_~i~0 99)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2091#(< xor_~i~0 100)} is VALID [2022-02-20 14:18:44,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {2095#(< xor_~i~0 99)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2095#(< xor_~i~0 99)} is VALID [2022-02-20 14:18:44,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {2102#(< xor_~i~0 98)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#(< xor_~i~0 99)} is VALID [2022-02-20 14:18:44,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {2102#(< xor_~i~0 98)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2102#(< xor_~i~0 98)} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2102#(< xor_~i~0 98)} is VALID [2022-02-20 14:18:44,103 INFO L272 TraceCheckUtils]: 51: Hoare triple {1846#true} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {1846#true} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {1846#true} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {1846#true} assume !(main_~i~2#1 < 99); {1846#true} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {1846#true} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1846#true} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {1846#true} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1846#true} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {1846#true} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1846#true} is VALID [2022-02-20 14:18:44,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {1846#true} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {1846#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1846#true} {1846#true} #67#return; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L272 TraceCheckUtils]: 34: Hoare triple {1846#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {1846#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {1846#true} is VALID [2022-02-20 14:18:44,104 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1846#true} {1846#true} #65#return; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {1846#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {1846#true} assume !(~i~0 < 100); {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {1846#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {1846#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {1846#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L272 TraceCheckUtils]: 23: Hoare triple {1846#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {1846#true} assume !(main_~i~1#1 < 100); {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {1846#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {1846#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {1846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {1846#true} is VALID [2022-02-20 14:18:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-02-20 14:18:44,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977202895] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:44,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:44,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 14:18:44,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364431108] [2022-02-20 14:18:44,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2022-02-20 14:18:44,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:44,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:44,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:44,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:18:44,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:44,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:18:44,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:18:44,147 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:44,249 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-02-20 14:18:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:18:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2022-02-20 14:18:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-02-20 14:18:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-02-20 14:18:44,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-02-20 14:18:44,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:44,309 INFO L225 Difference]: With dead ends: 78 [2022-02-20 14:18:44,309 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 14:18:44,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:18:44,311 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:44,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:18:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 14:18:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 14:18:44,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:44,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:44,331 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:44,331 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:44,333 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-02-20 14:18:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-20 14:18:44,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:44,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:44,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-02-20 14:18:44,334 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-02-20 14:18:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:44,336 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-02-20 14:18:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-20 14:18:44,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:44,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:44,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:44,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-02-20 14:18:44,339 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 64 [2022-02-20 14:18:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:44,339 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-02-20 14:18:44,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-20 14:18:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 14:18:44,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:44,340 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:44,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:44,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:44,561 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash 756543039, now seen corresponding path program 4 times [2022-02-20 14:18:44,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:44,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915188815] [2022-02-20 14:18:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 14:18:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:44,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:44,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:44,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:44,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:44,759 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2563#true} {2564#false} #65#return; {2564#false} is VALID [2022-02-20 14:18:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 14:18:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:44,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:44,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:44,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:44,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:44,776 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2563#true} {2564#false} #67#return; {2564#false} is VALID [2022-02-20 14:18:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 14:18:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:44,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:44,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:44,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:44,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:44,793 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2563#true} {2564#false} #69#return; {2564#false} is VALID [2022-02-20 14:18:44,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {2563#true} is VALID [2022-02-20 14:18:44,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {2565#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:44,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2565#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:44,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {2565#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:44,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:44,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:44,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:44,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:44,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:44,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:44,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:44,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:44,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:44,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:44,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:44,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:44,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:44,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:44,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:44,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:44,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:44,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2575#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:44,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {2575#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !(main_~i~1#1 < 100); {2564#false} is VALID [2022-02-20 14:18:44,803 INFO L272 TraceCheckUtils]: 23: Hoare triple {2564#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2563#true} is VALID [2022-02-20 14:18:44,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:44,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:44,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:44,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:44,806 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2563#true} {2564#false} #65#return; {2564#false} is VALID [2022-02-20 14:18:44,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {2564#false} is VALID [2022-02-20 14:18:44,806 INFO L272 TraceCheckUtils]: 42: Hoare triple {2564#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2563#true} is VALID [2022-02-20 14:18:44,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:44,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:44,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:44,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:44,809 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2563#true} {2564#false} #67#return; {2564#false} is VALID [2022-02-20 14:18:44,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {2564#false} is VALID [2022-02-20 14:18:44,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {2564#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {2564#false} is VALID [2022-02-20 14:18:44,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {2564#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2564#false} is VALID [2022-02-20 14:18:44,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {2564#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {2564#false} is VALID [2022-02-20 14:18:44,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {2564#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2564#false} is VALID [2022-02-20 14:18:44,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {2564#false} assume !(main_~i~2#1 < 99); {2564#false} is VALID [2022-02-20 14:18:44,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {2564#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {2564#false} is VALID [2022-02-20 14:18:44,810 INFO L272 TraceCheckUtils]: 67: Hoare triple {2564#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2563#true} is VALID [2022-02-20 14:18:44,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 71: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 72: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,812 INFO L290 TraceCheckUtils]: 79: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:44,812 INFO L290 TraceCheckUtils]: 80: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:44,812 INFO L290 TraceCheckUtils]: 81: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:44,813 INFO L290 TraceCheckUtils]: 82: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:44,813 INFO L290 TraceCheckUtils]: 83: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:44,813 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {2563#true} {2564#false} #69#return; {2564#false} is VALID [2022-02-20 14:18:44,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {2564#false} is VALID [2022-02-20 14:18:44,813 INFO L290 TraceCheckUtils]: 86: Hoare triple {2564#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {2564#false} is VALID [2022-02-20 14:18:44,813 INFO L290 TraceCheckUtils]: 87: Hoare triple {2564#false} assume !false; {2564#false} is VALID [2022-02-20 14:18:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-02-20 14:18:44,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:44,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915188815] [2022-02-20 14:18:44,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915188815] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:44,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090753143] [2022-02-20 14:18:44,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:18:44,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:44,820 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:44,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:18:44,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:18:44,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:18:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:18:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:44,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:45,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {2563#true} is VALID [2022-02-20 14:18:45,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {2633#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:45,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2633#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2633#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:45,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {2633#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:45,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:45,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {2566#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:45,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:45,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2567#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:45,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:45,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2568#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:45,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:45,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2569#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:45,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:45,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2570#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:45,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:45,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {2571#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:45,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:45,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:45,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:45,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {2573#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:45,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:45,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {2574#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2575#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:45,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {2575#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !(main_~i~1#1 < 100); {2564#false} is VALID [2022-02-20 14:18:45,255 INFO L272 TraceCheckUtils]: 23: Hoare triple {2564#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2564#false} is VALID [2022-02-20 14:18:45,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {2564#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2564#false} is VALID [2022-02-20 14:18:45,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {2564#false} assume !(~i~0 < 100); {2564#false} is VALID [2022-02-20 14:18:45,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {2564#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2564#false} is VALID [2022-02-20 14:18:45,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {2564#false} assume true; {2564#false} is VALID [2022-02-20 14:18:45,265 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2564#false} {2564#false} #65#return; {2564#false} is VALID [2022-02-20 14:18:45,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {2564#false} is VALID [2022-02-20 14:18:45,265 INFO L272 TraceCheckUtils]: 42: Hoare triple {2564#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2564#false} is VALID [2022-02-20 14:18:45,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {2564#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2564#false} is VALID [2022-02-20 14:18:45,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {2564#false} assume !(~i~0 < 100); {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {2564#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2564#false} is VALID [2022-02-20 14:18:45,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {2564#false} assume true; {2564#false} is VALID [2022-02-20 14:18:45,268 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2564#false} {2564#false} #67#return; {2564#false} is VALID [2022-02-20 14:18:45,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {2564#false} is VALID [2022-02-20 14:18:45,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {2564#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {2564#false} is VALID [2022-02-20 14:18:45,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {2564#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2564#false} is VALID [2022-02-20 14:18:45,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {2564#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {2564#false} is VALID [2022-02-20 14:18:45,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {2564#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {2564#false} assume !(main_~i~2#1 < 99); {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {2564#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L272 TraceCheckUtils]: 67: Hoare triple {2564#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {2564#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,270 INFO L290 TraceCheckUtils]: 72: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,270 INFO L290 TraceCheckUtils]: 74: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,270 INFO L290 TraceCheckUtils]: 77: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {2564#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2564#false} is VALID [2022-02-20 14:18:45,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {2564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2564#false} is VALID [2022-02-20 14:18:45,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {2564#false} assume !(~i~0 < 100); {2564#false} is VALID [2022-02-20 14:18:45,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {2564#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2564#false} is VALID [2022-02-20 14:18:45,271 INFO L290 TraceCheckUtils]: 83: Hoare triple {2564#false} assume true; {2564#false} is VALID [2022-02-20 14:18:45,272 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {2564#false} {2564#false} #69#return; {2564#false} is VALID [2022-02-20 14:18:45,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {2564#false} is VALID [2022-02-20 14:18:45,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {2564#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {2564#false} is VALID [2022-02-20 14:18:45,272 INFO L290 TraceCheckUtils]: 87: Hoare triple {2564#false} assume !false; {2564#false} is VALID [2022-02-20 14:18:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-02-20 14:18:45,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:45,712 INFO L290 TraceCheckUtils]: 87: Hoare triple {2564#false} assume !false; {2564#false} is VALID [2022-02-20 14:18:45,712 INFO L290 TraceCheckUtils]: 86: Hoare triple {2564#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {2564#false} is VALID [2022-02-20 14:18:45,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {2564#false} is VALID [2022-02-20 14:18:45,712 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {2563#true} {2564#false} #69#return; {2564#false} is VALID [2022-02-20 14:18:45,712 INFO L290 TraceCheckUtils]: 83: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:45,712 INFO L290 TraceCheckUtils]: 82: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:45,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:45,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:45,715 INFO L272 TraceCheckUtils]: 67: Hoare triple {2564#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2563#true} is VALID [2022-02-20 14:18:45,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {2564#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {2564#false} is VALID [2022-02-20 14:18:45,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {2564#false} assume !(main_~i~2#1 < 99); {2564#false} is VALID [2022-02-20 14:18:45,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {2564#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2564#false} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {2564#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {2564#false} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {2564#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2564#false} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {2564#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {2564#false} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {2564#false} is VALID [2022-02-20 14:18:45,716 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2563#true} {2564#false} #67#return; {2564#false} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 57: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:45,716 INFO L290 TraceCheckUtils]: 55: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:45,717 INFO L272 TraceCheckUtils]: 42: Hoare triple {2564#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2563#true} is VALID [2022-02-20 14:18:45,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {2564#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {2564#false} is VALID [2022-02-20 14:18:45,718 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2563#true} {2564#false} #65#return; {2564#false} is VALID [2022-02-20 14:18:45,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {2563#true} assume true; {2563#true} is VALID [2022-02-20 14:18:45,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {2563#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2563#true} is VALID [2022-02-20 14:18:45,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {2563#true} assume !(~i~0 < 100); {2563#true} is VALID [2022-02-20 14:18:45,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {2563#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2563#true} is VALID [2022-02-20 14:18:45,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {2563#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {2563#true} is VALID [2022-02-20 14:18:45,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {2563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {2563#true} is VALID [2022-02-20 14:18:45,720 INFO L272 TraceCheckUtils]: 23: Hoare triple {2564#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {2563#true} is VALID [2022-02-20 14:18:45,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {3087#(< |ULTIMATE.start_main_~i~1#1| 100)} assume !(main_~i~1#1 < 100); {2564#false} is VALID [2022-02-20 14:18:45,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {3091#(< |ULTIMATE.start_main_~i~1#1| 99)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3087#(< |ULTIMATE.start_main_~i~1#1| 100)} is VALID [2022-02-20 14:18:45,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {3091#(< |ULTIMATE.start_main_~i~1#1| 99)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3091#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:45,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {3098#(< |ULTIMATE.start_main_~i~1#1| 98)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3091#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:45,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {3098#(< |ULTIMATE.start_main_~i~1#1| 98)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3098#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:18:45,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {3105#(< |ULTIMATE.start_main_~i~1#1| 97)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3098#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:18:45,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {3105#(< |ULTIMATE.start_main_~i~1#1| 97)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3105#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:18:45,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {3112#(< |ULTIMATE.start_main_~i~1#1| 96)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3105#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:18:45,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {3112#(< |ULTIMATE.start_main_~i~1#1| 96)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3112#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:18:45,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {3119#(< |ULTIMATE.start_main_~i~1#1| 95)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3112#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:18:45,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {3119#(< |ULTIMATE.start_main_~i~1#1| 95)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3119#(< |ULTIMATE.start_main_~i~1#1| 95)} is VALID [2022-02-20 14:18:45,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {3126#(< |ULTIMATE.start_main_~i~1#1| 94)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3119#(< |ULTIMATE.start_main_~i~1#1| 95)} is VALID [2022-02-20 14:18:45,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {3126#(< |ULTIMATE.start_main_~i~1#1| 94)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3126#(< |ULTIMATE.start_main_~i~1#1| 94)} is VALID [2022-02-20 14:18:45,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {3133#(< |ULTIMATE.start_main_~i~1#1| 93)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3126#(< |ULTIMATE.start_main_~i~1#1| 94)} is VALID [2022-02-20 14:18:45,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#(< |ULTIMATE.start_main_~i~1#1| 93)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3133#(< |ULTIMATE.start_main_~i~1#1| 93)} is VALID [2022-02-20 14:18:45,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {3140#(< |ULTIMATE.start_main_~i~1#1| 92)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3133#(< |ULTIMATE.start_main_~i~1#1| 93)} is VALID [2022-02-20 14:18:45,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {3140#(< |ULTIMATE.start_main_~i~1#1| 92)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3140#(< |ULTIMATE.start_main_~i~1#1| 92)} is VALID [2022-02-20 14:18:45,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {3147#(< |ULTIMATE.start_main_~i~1#1| 91)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3140#(< |ULTIMATE.start_main_~i~1#1| 92)} is VALID [2022-02-20 14:18:45,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {3147#(< |ULTIMATE.start_main_~i~1#1| 91)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3147#(< |ULTIMATE.start_main_~i~1#1| 91)} is VALID [2022-02-20 14:18:45,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {3154#(< |ULTIMATE.start_main_~i~1#1| 90)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3147#(< |ULTIMATE.start_main_~i~1#1| 91)} is VALID [2022-02-20 14:18:45,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {3154#(< |ULTIMATE.start_main_~i~1#1| 90)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3154#(< |ULTIMATE.start_main_~i~1#1| 90)} is VALID [2022-02-20 14:18:45,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {3154#(< |ULTIMATE.start_main_~i~1#1| 90)} is VALID [2022-02-20 14:18:45,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {2563#true} is VALID [2022-02-20 14:18:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-02-20 14:18:45,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090753143] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:45,731 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:45,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:18:45,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865805936] [2022-02-20 14:18:45,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:45,732 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2022-02-20 14:18:45,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:45,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:45,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:45,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:18:45,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:18:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:18:45,797 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:46,000 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-02-20 14:18:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:18:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2022-02-20 14:18:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 102 transitions. [2022-02-20 14:18:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 102 transitions. [2022-02-20 14:18:46,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 102 transitions. [2022-02-20 14:18:46,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:46,089 INFO L225 Difference]: With dead ends: 111 [2022-02-20 14:18:46,089 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 14:18:46,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:18:46,090 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:46,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 134 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:18:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 14:18:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-02-20 14:18:46,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:46,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:46,124 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:46,124 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:46,126 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 14:18:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 14:18:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:46,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:46,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-02-20 14:18:46,128 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-02-20 14:18:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:46,130 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 14:18:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 14:18:46,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:46,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:46,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:46,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-02-20 14:18:46,133 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 88 [2022-02-20 14:18:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:46,134 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-02-20 14:18:46,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 14:18:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-20 14:18:46,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:46,135 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 18, 18, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:46,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:46,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:46,348 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:46,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1325683031, now seen corresponding path program 5 times [2022-02-20 14:18:46,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:46,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182441294] [2022-02-20 14:18:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 14:18:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:46,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:46,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:46,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:46,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:46,797 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3599#true} {3600#false} #65#return; {3600#false} is VALID [2022-02-20 14:18:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 14:18:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:46,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:46,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:46,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:46,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:46,813 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3599#true} {3600#false} #67#return; {3600#false} is VALID [2022-02-20 14:18:46,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-02-20 14:18:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:46,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:46,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:46,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:46,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:46,828 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3599#true} {3600#false} #69#return; {3600#false} is VALID [2022-02-20 14:18:46,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {3599#true} is VALID [2022-02-20 14:18:46,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {3601#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:46,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {3601#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3601#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:46,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {3601#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3602#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:46,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {3602#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3602#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:46,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {3602#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3603#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:46,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {3603#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3603#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:46,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {3603#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3604#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:46,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {3604#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3604#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:46,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {3604#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3605#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:46,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {3605#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3605#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:46,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {3605#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3606#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:46,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {3606#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3606#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:46,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {3606#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3607#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:46,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {3607#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3607#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:46,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {3607#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3608#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:46,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {3608#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3608#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:46,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {3608#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3609#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:46,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {3609#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3609#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:46,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {3609#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3610#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:46,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {3610#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3610#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:46,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {3610#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3611#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:46,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {3611#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3611#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:46,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {3611#(<= |ULTIMATE.start_main_~i~1#1| 10)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3612#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:46,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {3612#(<= |ULTIMATE.start_main_~i~1#1| 11)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3612#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:46,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {3612#(<= |ULTIMATE.start_main_~i~1#1| 11)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3613#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:46,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {3613#(<= |ULTIMATE.start_main_~i~1#1| 12)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3613#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:46,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {3613#(<= |ULTIMATE.start_main_~i~1#1| 12)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3614#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:46,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {3614#(<= |ULTIMATE.start_main_~i~1#1| 13)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3614#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:46,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {3614#(<= |ULTIMATE.start_main_~i~1#1| 13)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3615#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:46,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {3615#(<= |ULTIMATE.start_main_~i~1#1| 14)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3615#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:46,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {3615#(<= |ULTIMATE.start_main_~i~1#1| 14)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3616#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:46,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {3616#(<= |ULTIMATE.start_main_~i~1#1| 15)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3616#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:46,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {3616#(<= |ULTIMATE.start_main_~i~1#1| 15)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3617#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:46,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {3617#(<= |ULTIMATE.start_main_~i~1#1| 16)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3617#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:46,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {3617#(<= |ULTIMATE.start_main_~i~1#1| 16)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3618#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:46,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {3618#(<= |ULTIMATE.start_main_~i~1#1| 17)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3618#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:46,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {3618#(<= |ULTIMATE.start_main_~i~1#1| 17)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3619#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:46,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {3619#(<= |ULTIMATE.start_main_~i~1#1| 18)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3619#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:46,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {3619#(<= |ULTIMATE.start_main_~i~1#1| 18)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3620#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:46,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {3620#(<= |ULTIMATE.start_main_~i~1#1| 19)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3620#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:46,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {3620#(<= |ULTIMATE.start_main_~i~1#1| 19)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3621#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:46,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {3621#(<= |ULTIMATE.start_main_~i~1#1| 20)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3621#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:46,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {3621#(<= |ULTIMATE.start_main_~i~1#1| 20)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3622#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:46,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {3622#(<= |ULTIMATE.start_main_~i~1#1| 21)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3622#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:46,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {3622#(<= |ULTIMATE.start_main_~i~1#1| 21)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3623#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:46,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {3623#(<= |ULTIMATE.start_main_~i~1#1| 22)} assume !(main_~i~1#1 < 100); {3600#false} is VALID [2022-02-20 14:18:46,847 INFO L272 TraceCheckUtils]: 47: Hoare triple {3600#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:46,847 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:46,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,849 INFO L290 TraceCheckUtils]: 57: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,849 INFO L290 TraceCheckUtils]: 58: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,849 INFO L290 TraceCheckUtils]: 59: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,850 INFO L290 TraceCheckUtils]: 61: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:46,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:46,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:46,850 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3599#true} {3600#false} #65#return; {3600#false} is VALID [2022-02-20 14:18:46,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {3600#false} is VALID [2022-02-20 14:18:46,850 INFO L272 TraceCheckUtils]: 66: Hoare triple {3600#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:46,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:46,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,852 INFO L290 TraceCheckUtils]: 74: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,852 INFO L290 TraceCheckUtils]: 76: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,853 INFO L290 TraceCheckUtils]: 80: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:46,853 INFO L290 TraceCheckUtils]: 81: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:46,853 INFO L290 TraceCheckUtils]: 82: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:46,853 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {3599#true} {3600#false} #67#return; {3600#false} is VALID [2022-02-20 14:18:46,853 INFO L290 TraceCheckUtils]: 84: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {3600#false} is VALID [2022-02-20 14:18:46,853 INFO L290 TraceCheckUtils]: 85: Hoare triple {3600#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {3600#false} is VALID [2022-02-20 14:18:46,853 INFO L290 TraceCheckUtils]: 86: Hoare triple {3600#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3600#false} is VALID [2022-02-20 14:18:46,854 INFO L290 TraceCheckUtils]: 87: Hoare triple {3600#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {3600#false} is VALID [2022-02-20 14:18:46,854 INFO L290 TraceCheckUtils]: 88: Hoare triple {3600#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3600#false} is VALID [2022-02-20 14:18:46,854 INFO L290 TraceCheckUtils]: 89: Hoare triple {3600#false} assume !(main_~i~2#1 < 99); {3600#false} is VALID [2022-02-20 14:18:46,854 INFO L290 TraceCheckUtils]: 90: Hoare triple {3600#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {3600#false} is VALID [2022-02-20 14:18:46,854 INFO L272 TraceCheckUtils]: 91: Hoare triple {3600#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:46,854 INFO L290 TraceCheckUtils]: 92: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:46,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,855 INFO L290 TraceCheckUtils]: 94: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,855 INFO L290 TraceCheckUtils]: 95: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,855 INFO L290 TraceCheckUtils]: 96: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,855 INFO L290 TraceCheckUtils]: 97: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,855 INFO L290 TraceCheckUtils]: 98: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,856 INFO L290 TraceCheckUtils]: 99: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,856 INFO L290 TraceCheckUtils]: 103: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:46,856 INFO L290 TraceCheckUtils]: 104: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:46,857 INFO L290 TraceCheckUtils]: 105: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:46,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:46,857 INFO L290 TraceCheckUtils]: 107: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:46,857 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {3599#true} {3600#false} #69#return; {3600#false} is VALID [2022-02-20 14:18:46,857 INFO L290 TraceCheckUtils]: 109: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {3600#false} is VALID [2022-02-20 14:18:46,857 INFO L290 TraceCheckUtils]: 110: Hoare triple {3600#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {3600#false} is VALID [2022-02-20 14:18:46,857 INFO L290 TraceCheckUtils]: 111: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2022-02-20 14:18:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-02-20 14:18:46,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:46,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182441294] [2022-02-20 14:18:46,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182441294] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:46,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506533897] [2022-02-20 14:18:46,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:18:46,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:46,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:46,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 14:18:48,707 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2022-02-20 14:18:48,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:18:48,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:18:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:48,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:49,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {3599#true} is VALID [2022-02-20 14:18:49,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {3599#true} is VALID [2022-02-20 14:18:49,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {3599#true} assume !(main_~i~1#1 < 100); {3599#true} is VALID [2022-02-20 14:18:49,105 INFO L272 TraceCheckUtils]: 47: Hoare triple {3599#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:49,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3822#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:49,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {3822#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3822#(<= xor_~i~0 1)} is VALID [2022-02-20 14:18:49,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {3822#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3829#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:49,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {3829#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3829#(<= xor_~i~0 2)} is VALID [2022-02-20 14:18:49,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {3829#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3836#(<= xor_~i~0 3)} is VALID [2022-02-20 14:18:49,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {3836#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3836#(<= xor_~i~0 3)} is VALID [2022-02-20 14:18:49,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {3836#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3843#(<= xor_~i~0 4)} is VALID [2022-02-20 14:18:49,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {3843#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3843#(<= xor_~i~0 4)} is VALID [2022-02-20 14:18:49,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {3843#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3850#(<= xor_~i~0 5)} is VALID [2022-02-20 14:18:49,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {3850#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3850#(<= xor_~i~0 5)} is VALID [2022-02-20 14:18:49,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {3850#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3857#(<= xor_~i~0 6)} is VALID [2022-02-20 14:18:49,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {3857#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3857#(<= xor_~i~0 6)} is VALID [2022-02-20 14:18:49,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {3857#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3864#(<= xor_~i~0 7)} is VALID [2022-02-20 14:18:49,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {3864#(<= xor_~i~0 7)} assume !(~i~0 < 100); {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {3600#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {3600#false} assume true; {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3600#false} {3599#true} #65#return; {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L272 TraceCheckUtils]: 66: Hoare triple {3600#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {3600#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,113 INFO L290 TraceCheckUtils]: 79: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {3600#false} assume !(~i~0 < 100); {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {3600#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {3600#false} assume true; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {3600#false} {3600#false} #67#return; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 84: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 85: Hoare triple {3600#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 86: Hoare triple {3600#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 87: Hoare triple {3600#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {3600#false} is VALID [2022-02-20 14:18:49,114 INFO L290 TraceCheckUtils]: 88: Hoare triple {3600#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3600#false} is VALID [2022-02-20 14:18:49,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {3600#false} assume !(main_~i~2#1 < 99); {3600#false} is VALID [2022-02-20 14:18:49,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {3600#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {3600#false} is VALID [2022-02-20 14:18:49,117 INFO L272 TraceCheckUtils]: 91: Hoare triple {3600#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3600#false} is VALID [2022-02-20 14:18:49,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {3600#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3600#false} is VALID [2022-02-20 14:18:49,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,117 INFO L290 TraceCheckUtils]: 95: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,118 INFO L290 TraceCheckUtils]: 97: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,118 INFO L290 TraceCheckUtils]: 98: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,119 INFO L290 TraceCheckUtils]: 102: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,119 INFO L290 TraceCheckUtils]: 103: Hoare triple {3600#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3600#false} is VALID [2022-02-20 14:18:49,119 INFO L290 TraceCheckUtils]: 104: Hoare triple {3600#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3600#false} is VALID [2022-02-20 14:18:49,119 INFO L290 TraceCheckUtils]: 105: Hoare triple {3600#false} assume !(~i~0 < 100); {3600#false} is VALID [2022-02-20 14:18:49,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {3600#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3600#false} is VALID [2022-02-20 14:18:49,119 INFO L290 TraceCheckUtils]: 107: Hoare triple {3600#false} assume true; {3600#false} is VALID [2022-02-20 14:18:49,120 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {3600#false} {3600#false} #69#return; {3600#false} is VALID [2022-02-20 14:18:49,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {3600#false} is VALID [2022-02-20 14:18:49,121 INFO L290 TraceCheckUtils]: 110: Hoare triple {3600#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {3600#false} is VALID [2022-02-20 14:18:49,121 INFO L290 TraceCheckUtils]: 111: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2022-02-20 14:18:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2022-02-20 14:18:49,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:49,567 INFO L290 TraceCheckUtils]: 111: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2022-02-20 14:18:49,567 INFO L290 TraceCheckUtils]: 110: Hoare triple {3600#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {3600#false} is VALID [2022-02-20 14:18:49,567 INFO L290 TraceCheckUtils]: 109: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {3600#false} is VALID [2022-02-20 14:18:49,567 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {3599#true} {3600#false} #69#return; {3600#false} is VALID [2022-02-20 14:18:49,567 INFO L290 TraceCheckUtils]: 107: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:49,568 INFO L290 TraceCheckUtils]: 106: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:49,568 INFO L290 TraceCheckUtils]: 105: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:49,568 INFO L290 TraceCheckUtils]: 104: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,568 INFO L290 TraceCheckUtils]: 103: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,568 INFO L290 TraceCheckUtils]: 102: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,568 INFO L290 TraceCheckUtils]: 101: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 100: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 99: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 98: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 97: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 96: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 95: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,569 INFO L290 TraceCheckUtils]: 94: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,570 INFO L290 TraceCheckUtils]: 93: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,570 INFO L290 TraceCheckUtils]: 92: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:49,570 INFO L272 TraceCheckUtils]: 91: Hoare triple {3600#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:49,570 INFO L290 TraceCheckUtils]: 90: Hoare triple {3600#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {3600#false} is VALID [2022-02-20 14:18:49,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {3600#false} assume !(main_~i~2#1 < 99); {3600#false} is VALID [2022-02-20 14:18:49,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {3600#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3600#false} is VALID [2022-02-20 14:18:49,571 INFO L290 TraceCheckUtils]: 87: Hoare triple {3600#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {3600#false} is VALID [2022-02-20 14:18:49,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {3600#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3600#false} is VALID [2022-02-20 14:18:49,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {3600#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {3600#false} is VALID [2022-02-20 14:18:49,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {3600#false} is VALID [2022-02-20 14:18:49,571 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {3599#true} {3600#false} #67#return; {3600#false} is VALID [2022-02-20 14:18:49,571 INFO L290 TraceCheckUtils]: 82: Hoare triple {3599#true} assume true; {3599#true} is VALID [2022-02-20 14:18:49,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {3599#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3599#true} is VALID [2022-02-20 14:18:49,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {3599#true} assume !(~i~0 < 100); {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 79: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 78: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 77: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 76: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {3599#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {3599#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {3599#true} is VALID [2022-02-20 14:18:49,574 INFO L272 TraceCheckUtils]: 66: Hoare triple {3600#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:49,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {3600#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {3600#false} is VALID [2022-02-20 14:18:49,575 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3600#false} {3599#true} #65#return; {3600#false} is VALID [2022-02-20 14:18:49,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {3600#false} assume true; {3600#false} is VALID [2022-02-20 14:18:49,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {3600#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3600#false} is VALID [2022-02-20 14:18:49,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {4171#(< xor_~i~0 100)} assume !(~i~0 < 100); {3600#false} is VALID [2022-02-20 14:18:49,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {4175#(< xor_~i~0 99)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4171#(< xor_~i~0 100)} is VALID [2022-02-20 14:18:49,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {4175#(< xor_~i~0 99)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4175#(< xor_~i~0 99)} is VALID [2022-02-20 14:18:49,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {4182#(< xor_~i~0 98)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4175#(< xor_~i~0 99)} is VALID [2022-02-20 14:18:49,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {4182#(< xor_~i~0 98)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4182#(< xor_~i~0 98)} is VALID [2022-02-20 14:18:49,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {4189#(< xor_~i~0 97)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4182#(< xor_~i~0 98)} is VALID [2022-02-20 14:18:49,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {4189#(< xor_~i~0 97)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4189#(< xor_~i~0 97)} is VALID [2022-02-20 14:18:49,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {4196#(< xor_~i~0 96)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4189#(< xor_~i~0 97)} is VALID [2022-02-20 14:18:49,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {4196#(< xor_~i~0 96)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4196#(< xor_~i~0 96)} is VALID [2022-02-20 14:18:49,579 INFO L290 TraceCheckUtils]: 52: Hoare triple {4203#(< xor_~i~0 95)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4196#(< xor_~i~0 96)} is VALID [2022-02-20 14:18:49,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {4203#(< xor_~i~0 95)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4203#(< xor_~i~0 95)} is VALID [2022-02-20 14:18:49,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {4210#(< xor_~i~0 94)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4203#(< xor_~i~0 95)} is VALID [2022-02-20 14:18:49,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {4210#(< xor_~i~0 94)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4210#(< xor_~i~0 94)} is VALID [2022-02-20 14:18:49,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4210#(< xor_~i~0 94)} is VALID [2022-02-20 14:18:49,581 INFO L272 TraceCheckUtils]: 47: Hoare triple {3599#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {3599#true} is VALID [2022-02-20 14:18:49,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {3599#true} assume !(main_~i~1#1 < 100); {3599#true} is VALID [2022-02-20 14:18:49,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {3599#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3599#true} is VALID [2022-02-20 14:18:49,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {3599#true} is VALID [2022-02-20 14:18:49,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {3599#true} is VALID [2022-02-20 14:18:49,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {3599#true} is VALID [2022-02-20 14:18:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-20 14:18:49,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506533897] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:49,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:49,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 9] total 39 [2022-02-20 14:18:49,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33476310] [2022-02-20 14:18:49,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 112 [2022-02-20 14:18:49,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:49,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:49,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:49,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-20 14:18:49,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-20 14:18:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 14:18:49,679 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:49,964 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2022-02-20 14:18:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-20 14:18:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 112 [2022-02-20 14:18:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 132 transitions. [2022-02-20 14:18:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 132 transitions. [2022-02-20 14:18:49,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 132 transitions. [2022-02-20 14:18:50,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:50,077 INFO L225 Difference]: With dead ends: 130 [2022-02-20 14:18:50,077 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 14:18:50,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 14:18:50,079 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:50,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 142 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:18:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 14:18:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-02-20 14:18:50,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:50,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:50,120 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:50,121 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:50,124 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-02-20 14:18:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-02-20 14:18:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:50,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 98 states. [2022-02-20 14:18:50,133 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 98 states. [2022-02-20 14:18:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:50,139 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-02-20 14:18:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-02-20 14:18:50,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:50,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:50,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:50,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-02-20 14:18:50,144 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 112 [2022-02-20 14:18:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:50,144 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-02-20 14:18:50,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-02-20 14:18:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-02-20 14:18:50,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:50,149 INFO L514 BasicCegarLoop]: trace histogram [42, 42, 23, 23, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:50,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:50,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-20 14:18:50,356 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2024695735, now seen corresponding path program 6 times [2022-02-20 14:18:50,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:50,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513708753] [2022-02-20 14:18:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 14:18:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:50,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:50,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:50,815 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4886#true} {4887#false} #65#return; {4887#false} is VALID [2022-02-20 14:18:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-02-20 14:18:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:50,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:50,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:50,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:50,841 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4886#true} {4887#false} #67#return; {4887#false} is VALID [2022-02-20 14:18:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-02-20 14:18:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:50,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:50,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:50,871 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4886#true} {4887#false} #69#return; {4887#false} is VALID [2022-02-20 14:18:50,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {4886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {4886#true} is VALID [2022-02-20 14:18:50,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {4886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {4888#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:50,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {4888#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4888#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:50,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {4888#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4889#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:50,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {4889#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4889#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:50,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {4889#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4890#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:50,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {4890#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4890#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:50,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {4890#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4891#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:50,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {4891#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4891#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:50,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {4891#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4892#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:50,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {4892#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4892#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:50,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {4892#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4893#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:50,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {4893#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4893#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:50,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {4893#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4894#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:50,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {4894#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4894#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:50,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {4894#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4895#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:50,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {4895#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4895#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:50,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {4895#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4896#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:50,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {4896#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4896#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:50,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {4896#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4897#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:50,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {4897#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4897#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:50,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {4897#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4898#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:50,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {4898#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4898#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:50,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {4898#(<= |ULTIMATE.start_main_~i~1#1| 10)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4899#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:50,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {4899#(<= |ULTIMATE.start_main_~i~1#1| 11)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4899#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:50,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {4899#(<= |ULTIMATE.start_main_~i~1#1| 11)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4900#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:50,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {4900#(<= |ULTIMATE.start_main_~i~1#1| 12)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4900#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:50,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {4900#(<= |ULTIMATE.start_main_~i~1#1| 12)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4901#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:50,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {4901#(<= |ULTIMATE.start_main_~i~1#1| 13)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4901#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:50,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {4901#(<= |ULTIMATE.start_main_~i~1#1| 13)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4902#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:50,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {4902#(<= |ULTIMATE.start_main_~i~1#1| 14)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4902#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:50,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {4902#(<= |ULTIMATE.start_main_~i~1#1| 14)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4903#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:50,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {4903#(<= |ULTIMATE.start_main_~i~1#1| 15)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4903#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:50,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {4903#(<= |ULTIMATE.start_main_~i~1#1| 15)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4904#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:50,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {4904#(<= |ULTIMATE.start_main_~i~1#1| 16)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4904#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:50,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {4904#(<= |ULTIMATE.start_main_~i~1#1| 16)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4905#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:50,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {4905#(<= |ULTIMATE.start_main_~i~1#1| 17)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4905#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:50,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {4905#(<= |ULTIMATE.start_main_~i~1#1| 17)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4906#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:50,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {4906#(<= |ULTIMATE.start_main_~i~1#1| 18)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4906#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:50,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {4906#(<= |ULTIMATE.start_main_~i~1#1| 18)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4907#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:50,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {4907#(<= |ULTIMATE.start_main_~i~1#1| 19)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4907#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:50,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {4907#(<= |ULTIMATE.start_main_~i~1#1| 19)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4908#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:50,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {4908#(<= |ULTIMATE.start_main_~i~1#1| 20)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4908#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:50,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {4908#(<= |ULTIMATE.start_main_~i~1#1| 20)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4909#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:50,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {4909#(<= |ULTIMATE.start_main_~i~1#1| 21)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4909#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:50,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {4909#(<= |ULTIMATE.start_main_~i~1#1| 21)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4910#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:50,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {4910#(<= |ULTIMATE.start_main_~i~1#1| 22)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4910#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:50,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {4910#(<= |ULTIMATE.start_main_~i~1#1| 22)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4911#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:50,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {4911#(<= |ULTIMATE.start_main_~i~1#1| 23)} assume !(main_~i~1#1 < 100); {4887#false} is VALID [2022-02-20 14:18:50,892 INFO L272 TraceCheckUtils]: 49: Hoare triple {4887#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,894 INFO L290 TraceCheckUtils]: 59: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,894 INFO L290 TraceCheckUtils]: 60: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 63: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 64: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 67: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 68: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,895 INFO L290 TraceCheckUtils]: 69: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 71: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 72: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 73: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 74: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 75: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,896 INFO L290 TraceCheckUtils]: 76: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,897 INFO L290 TraceCheckUtils]: 77: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:50,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:50,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:50,897 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {4886#true} {4887#false} #65#return; {4887#false} is VALID [2022-02-20 14:18:50,898 INFO L290 TraceCheckUtils]: 83: Hoare triple {4887#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {4887#false} is VALID [2022-02-20 14:18:50,898 INFO L272 TraceCheckUtils]: 84: Hoare triple {4887#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:50,898 INFO L290 TraceCheckUtils]: 85: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:50,898 INFO L290 TraceCheckUtils]: 86: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,898 INFO L290 TraceCheckUtils]: 87: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,898 INFO L290 TraceCheckUtils]: 88: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,898 INFO L290 TraceCheckUtils]: 89: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 90: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 91: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 92: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 93: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 94: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 95: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 104: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 105: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 106: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 107: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 108: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 109: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,901 INFO L290 TraceCheckUtils]: 110: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L290 TraceCheckUtils]: 111: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L290 TraceCheckUtils]: 112: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L290 TraceCheckUtils]: 113: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L290 TraceCheckUtils]: 115: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L290 TraceCheckUtils]: 116: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:50,902 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {4886#true} {4887#false} #67#return; {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 118: Hoare triple {4887#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 119: Hoare triple {4887#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 120: Hoare triple {4887#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 121: Hoare triple {4887#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 122: Hoare triple {4887#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 123: Hoare triple {4887#false} assume !(main_~i~2#1 < 99); {4887#false} is VALID [2022-02-20 14:18:50,903 INFO L290 TraceCheckUtils]: 124: Hoare triple {4887#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {4887#false} is VALID [2022-02-20 14:18:50,904 INFO L272 TraceCheckUtils]: 125: Hoare triple {4887#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:50,904 INFO L290 TraceCheckUtils]: 126: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:50,904 INFO L290 TraceCheckUtils]: 127: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,904 INFO L290 TraceCheckUtils]: 128: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,904 INFO L290 TraceCheckUtils]: 129: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,904 INFO L290 TraceCheckUtils]: 130: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 131: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 132: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 133: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 134: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 135: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 136: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,905 INFO L290 TraceCheckUtils]: 137: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 138: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 139: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 140: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 141: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 142: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 143: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,906 INFO L290 TraceCheckUtils]: 144: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 145: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 146: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 147: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 148: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 149: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 150: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,907 INFO L290 TraceCheckUtils]: 151: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L290 TraceCheckUtils]: 152: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L290 TraceCheckUtils]: 153: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L290 TraceCheckUtils]: 154: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L290 TraceCheckUtils]: 155: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L290 TraceCheckUtils]: 156: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L290 TraceCheckUtils]: 157: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:50,908 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4886#true} {4887#false} #69#return; {4887#false} is VALID [2022-02-20 14:18:50,909 INFO L290 TraceCheckUtils]: 159: Hoare triple {4887#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {4887#false} is VALID [2022-02-20 14:18:50,909 INFO L290 TraceCheckUtils]: 160: Hoare triple {4887#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {4887#false} is VALID [2022-02-20 14:18:50,909 INFO L290 TraceCheckUtils]: 161: Hoare triple {4887#false} assume !false; {4887#false} is VALID [2022-02-20 14:18:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1867 trivial. 0 not checked. [2022-02-20 14:18:50,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:50,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513708753] [2022-02-20 14:18:50,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513708753] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:50,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018202395] [2022-02-20 14:18:50,911 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 14:18:50,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:50,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:50,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:50,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 14:18:51,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 14:18:51,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:18:51,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:18:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:51,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:51,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {4886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {4886#true} is VALID [2022-02-20 14:18:51,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {4886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {4886#true} is VALID [2022-02-20 14:18:51,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#true} assume !(main_~i~1#1 < 100); {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L272 TraceCheckUtils]: 49: Hoare triple {4886#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,509 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 66: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 69: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 70: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,511 INFO L290 TraceCheckUtils]: 71: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 79: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 80: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L290 TraceCheckUtils]: 81: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:51,512 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {4886#true} {4886#true} #65#return; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 83: Hoare triple {4886#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L272 TraceCheckUtils]: 84: Hoare triple {4886#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 85: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 86: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 87: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,513 INFO L290 TraceCheckUtils]: 91: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 99: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 100: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,514 INFO L290 TraceCheckUtils]: 101: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 102: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 103: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 104: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 105: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 106: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 107: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 108: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 109: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 110: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,515 INFO L290 TraceCheckUtils]: 111: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,516 INFO L290 TraceCheckUtils]: 112: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,516 INFO L290 TraceCheckUtils]: 113: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,516 INFO L290 TraceCheckUtils]: 114: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:51,516 INFO L290 TraceCheckUtils]: 115: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:51,516 INFO L290 TraceCheckUtils]: 116: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:51,516 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {4886#true} {4886#true} #67#return; {4886#true} is VALID [2022-02-20 14:18:51,517 INFO L290 TraceCheckUtils]: 118: Hoare triple {4886#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {5368#(<= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:18:51,517 INFO L290 TraceCheckUtils]: 119: Hoare triple {5368#(<= |ULTIMATE.start_main_~i~2#1| 0)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {5368#(<= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:18:51,517 INFO L290 TraceCheckUtils]: 120: Hoare triple {5368#(<= |ULTIMATE.start_main_~i~2#1| 0)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5375#(<= |ULTIMATE.start_main_~i~2#1| 1)} is VALID [2022-02-20 14:18:51,518 INFO L290 TraceCheckUtils]: 121: Hoare triple {5375#(<= |ULTIMATE.start_main_~i~2#1| 1)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {5375#(<= |ULTIMATE.start_main_~i~2#1| 1)} is VALID [2022-02-20 14:18:51,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {5375#(<= |ULTIMATE.start_main_~i~2#1| 1)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5382#(<= |ULTIMATE.start_main_~i~2#1| 2)} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 123: Hoare triple {5382#(<= |ULTIMATE.start_main_~i~2#1| 2)} assume !(main_~i~2#1 < 99); {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 124: Hoare triple {4887#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L272 TraceCheckUtils]: 125: Hoare triple {4887#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 126: Hoare triple {4887#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 127: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 128: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 129: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 130: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 131: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,519 INFO L290 TraceCheckUtils]: 132: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 133: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 134: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 135: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 136: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 137: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 138: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 139: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 140: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,520 INFO L290 TraceCheckUtils]: 141: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 142: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 143: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 144: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 145: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 146: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 147: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 148: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 149: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 150: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,521 INFO L290 TraceCheckUtils]: 151: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 152: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 153: Hoare triple {4887#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 154: Hoare triple {4887#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 155: Hoare triple {4887#false} assume !(~i~0 < 100); {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 156: Hoare triple {4887#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 157: Hoare triple {4887#false} assume true; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4887#false} {4887#false} #69#return; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 159: Hoare triple {4887#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {4887#false} is VALID [2022-02-20 14:18:51,522 INFO L290 TraceCheckUtils]: 160: Hoare triple {4887#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {4887#false} is VALID [2022-02-20 14:18:51,523 INFO L290 TraceCheckUtils]: 161: Hoare triple {4887#false} assume !false; {4887#false} is VALID [2022-02-20 14:18:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 850 proven. 4 refuted. 0 times theorem prover too weak. 1542 trivial. 0 not checked. [2022-02-20 14:18:51,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:51,857 INFO L290 TraceCheckUtils]: 161: Hoare triple {4887#false} assume !false; {4887#false} is VALID [2022-02-20 14:18:51,857 INFO L290 TraceCheckUtils]: 160: Hoare triple {4887#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {4887#false} is VALID [2022-02-20 14:18:51,859 INFO L290 TraceCheckUtils]: 159: Hoare triple {4887#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {4887#false} is VALID [2022-02-20 14:18:51,859 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4886#true} {4887#false} #69#return; {4887#false} is VALID [2022-02-20 14:18:51,859 INFO L290 TraceCheckUtils]: 157: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:51,859 INFO L290 TraceCheckUtils]: 156: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:51,859 INFO L290 TraceCheckUtils]: 155: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:51,860 INFO L290 TraceCheckUtils]: 154: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,860 INFO L290 TraceCheckUtils]: 153: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,860 INFO L290 TraceCheckUtils]: 152: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,860 INFO L290 TraceCheckUtils]: 151: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,860 INFO L290 TraceCheckUtils]: 150: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,860 INFO L290 TraceCheckUtils]: 149: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 148: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 147: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 146: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 145: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 144: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 143: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,861 INFO L290 TraceCheckUtils]: 142: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,862 INFO L290 TraceCheckUtils]: 141: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,862 INFO L290 TraceCheckUtils]: 140: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,862 INFO L290 TraceCheckUtils]: 139: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,862 INFO L290 TraceCheckUtils]: 138: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,862 INFO L290 TraceCheckUtils]: 137: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,862 INFO L290 TraceCheckUtils]: 136: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 135: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 134: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 133: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 132: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 131: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 130: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,863 INFO L290 TraceCheckUtils]: 129: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,864 INFO L290 TraceCheckUtils]: 128: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,864 INFO L290 TraceCheckUtils]: 127: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,864 INFO L290 TraceCheckUtils]: 126: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:51,864 INFO L272 TraceCheckUtils]: 125: Hoare triple {4887#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:51,864 INFO L290 TraceCheckUtils]: 124: Hoare triple {4887#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {4887#false} is VALID [2022-02-20 14:18:51,867 INFO L290 TraceCheckUtils]: 123: Hoare triple {5614#(< |ULTIMATE.start_main_~i~2#1| 99)} assume !(main_~i~2#1 < 99); {4887#false} is VALID [2022-02-20 14:18:51,868 INFO L290 TraceCheckUtils]: 122: Hoare triple {5618#(< |ULTIMATE.start_main_~i~2#1| 98)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5614#(< |ULTIMATE.start_main_~i~2#1| 99)} is VALID [2022-02-20 14:18:51,868 INFO L290 TraceCheckUtils]: 121: Hoare triple {5618#(< |ULTIMATE.start_main_~i~2#1| 98)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {5618#(< |ULTIMATE.start_main_~i~2#1| 98)} is VALID [2022-02-20 14:18:51,869 INFO L290 TraceCheckUtils]: 120: Hoare triple {5625#(< |ULTIMATE.start_main_~i~2#1| 97)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5618#(< |ULTIMATE.start_main_~i~2#1| 98)} is VALID [2022-02-20 14:18:51,869 INFO L290 TraceCheckUtils]: 119: Hoare triple {5625#(< |ULTIMATE.start_main_~i~2#1| 97)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {5625#(< |ULTIMATE.start_main_~i~2#1| 97)} is VALID [2022-02-20 14:18:51,870 INFO L290 TraceCheckUtils]: 118: Hoare triple {4886#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {5625#(< |ULTIMATE.start_main_~i~2#1| 97)} is VALID [2022-02-20 14:18:51,870 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {4886#true} {4886#true} #67#return; {4886#true} is VALID [2022-02-20 14:18:51,870 INFO L290 TraceCheckUtils]: 116: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:51,870 INFO L290 TraceCheckUtils]: 115: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:51,870 INFO L290 TraceCheckUtils]: 114: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:51,871 INFO L290 TraceCheckUtils]: 113: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,871 INFO L290 TraceCheckUtils]: 111: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,871 INFO L290 TraceCheckUtils]: 110: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,871 INFO L290 TraceCheckUtils]: 109: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,871 INFO L290 TraceCheckUtils]: 108: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 107: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 106: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 105: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 104: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 103: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 102: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,872 INFO L290 TraceCheckUtils]: 101: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 100: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 99: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 97: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 96: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 91: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 90: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 88: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,874 INFO L290 TraceCheckUtils]: 87: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,875 INFO L290 TraceCheckUtils]: 85: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:51,877 INFO L272 TraceCheckUtils]: 84: Hoare triple {4886#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:51,877 INFO L290 TraceCheckUtils]: 83: Hoare triple {4886#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {4886#true} {4886#true} #65#return; {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {4886#true} assume true; {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {4886#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {4886#true} assume !(~i~0 < 100); {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L290 TraceCheckUtils]: 77: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {4886#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {4886#true} is VALID [2022-02-20 14:18:51,883 INFO L272 TraceCheckUtils]: 49: Hoare triple {4886#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#true} assume !(main_~i~1#1 < 100); {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {4886#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4886#true} is VALID [2022-02-20 14:18:51,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {4886#true} is VALID [2022-02-20 14:18:51,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {4886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {4886#true} is VALID [2022-02-20 14:18:51,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {4886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {4886#true} is VALID [2022-02-20 14:18:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2392 trivial. 0 not checked. [2022-02-20 14:18:51,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018202395] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:51,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:51,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5, 5] total 32 [2022-02-20 14:18:51,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790151157] [2022-02-20 14:18:51,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:51,899 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2022-02-20 14:18:51,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:51,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:51,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:51,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-20 14:18:51,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-20 14:18:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=640, Unknown=0, NotChecked=0, Total=992 [2022-02-20 14:18:51,977 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:52,232 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-02-20 14:18:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-20 14:18:52,233 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2022-02-20 14:18:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2022-02-20 14:18:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2022-02-20 14:18:52,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 111 transitions. [2022-02-20 14:18:52,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:52,337 INFO L225 Difference]: With dead ends: 156 [2022-02-20 14:18:52,337 INFO L226 Difference]: Without dead ends: 108 [2022-02-20 14:18:52,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=640, Unknown=0, NotChecked=0, Total=992 [2022-02-20 14:18:52,339 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:52,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 139 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:18:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-20 14:18:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-02-20 14:18:52,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:52,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:52,387 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:52,388 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:52,392 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-02-20 14:18:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-02-20 14:18:52,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:52,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:52,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 108 states. [2022-02-20 14:18:52,393 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 108 states. [2022-02-20 14:18:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:52,396 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-02-20 14:18:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-02-20 14:18:52,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:52,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:52,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:52,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-02-20 14:18:52,400 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 162 [2022-02-20 14:18:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:52,400 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-02-20 14:18:52,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:18:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-02-20 14:18:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-02-20 14:18:52,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:52,404 INFO L514 BasicCegarLoop]: trace histogram [42, 42, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:52,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-20 14:18:52,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:52,607 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash -615578557, now seen corresponding path program 7 times [2022-02-20 14:18:52,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:52,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494349799] [2022-02-20 14:18:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 14:18:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:53,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:53,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:53,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:53,086 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6588#true} {6589#false} #65#return; {6589#false} is VALID [2022-02-20 14:18:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-20 14:18:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:53,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:53,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:53,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:53,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:53,110 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6588#true} {6589#false} #67#return; {6589#false} is VALID [2022-02-20 14:18:53,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-02-20 14:18:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:53,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:53,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:53,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:53,134 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6588#true} {6589#false} #69#return; {6589#false} is VALID [2022-02-20 14:18:53,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {6588#true} is VALID [2022-02-20 14:18:53,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {6590#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:53,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {6590#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6590#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:53,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {6590#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:53,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:53,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:53,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:53,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:53,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:53,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:53,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:53,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:53,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:53,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:53,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:53,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:53,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:53,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:53,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:53,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:53,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:53,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:53,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:53,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:53,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:53,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:53,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:53,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:53,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:53,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:53,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:53,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:53,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:53,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:53,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:53,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:53,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:53,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:53,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:53,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:53,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:53,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:53,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:53,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:53,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:53,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:53,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:53,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:53,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:53,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6614#(<= |ULTIMATE.start_main_~i~1#1| 24)} is VALID [2022-02-20 14:18:53,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {6614#(<= |ULTIMATE.start_main_~i~1#1| 24)} assume !(main_~i~1#1 < 100); {6589#false} is VALID [2022-02-20 14:18:53,159 INFO L272 TraceCheckUtils]: 51: Hoare triple {6589#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6588#true} is VALID [2022-02-20 14:18:53,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:53,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:53,162 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6588#true} {6589#false} #65#return; {6589#false} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 85: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {6589#false} is VALID [2022-02-20 14:18:53,163 INFO L272 TraceCheckUtils]: 86: Hoare triple {6589#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6588#true} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 87: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 88: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 89: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 91: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,163 INFO L290 TraceCheckUtils]: 92: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 93: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 94: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 95: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 96: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 97: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 98: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 99: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,164 INFO L290 TraceCheckUtils]: 101: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 102: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 103: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 106: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 107: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 108: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,165 INFO L290 TraceCheckUtils]: 109: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 110: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 111: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 112: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 113: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 114: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 115: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 116: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 117: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L290 TraceCheckUtils]: 118: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:53,166 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {6588#true} {6589#false} #67#return; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 120: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 121: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 122: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 123: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 124: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 125: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 126: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 127: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 128: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:53,167 INFO L290 TraceCheckUtils]: 129: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 130: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 131: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 132: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 133: Hoare triple {6589#false} assume !(main_~i~2#1 < 99); {6589#false} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 134: Hoare triple {6589#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {6589#false} is VALID [2022-02-20 14:18:53,168 INFO L272 TraceCheckUtils]: 135: Hoare triple {6589#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6588#true} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 136: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 137: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 138: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,168 INFO L290 TraceCheckUtils]: 139: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 140: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 141: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 142: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 143: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 144: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 145: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 146: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 147: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 148: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,169 INFO L290 TraceCheckUtils]: 149: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 150: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 151: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 152: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 153: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 154: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 155: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 156: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 157: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 158: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,170 INFO L290 TraceCheckUtils]: 159: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 160: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 161: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 162: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 163: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 164: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 165: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 166: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 167: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:53,171 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {6588#true} {6589#false} #69#return; {6589#false} is VALID [2022-02-20 14:18:53,171 INFO L290 TraceCheckUtils]: 169: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {6589#false} is VALID [2022-02-20 14:18:53,172 INFO L290 TraceCheckUtils]: 170: Hoare triple {6589#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {6589#false} is VALID [2022-02-20 14:18:53,172 INFO L290 TraceCheckUtils]: 171: Hoare triple {6589#false} assume !false; {6589#false} is VALID [2022-02-20 14:18:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2022-02-20 14:18:53,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:53,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494349799] [2022-02-20 14:18:53,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494349799] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:53,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860129364] [2022-02-20 14:18:53,173 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 14:18:53,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:53,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:53,176 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:53,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 14:18:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:53,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 14:18:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:53,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:54,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {6588#true} is VALID [2022-02-20 14:18:54,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {6720#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:54,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {6720#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6720#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:54,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {6720#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:54,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:54,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {6591#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:54,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:54,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:54,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:54,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {6593#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:54,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:54,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {6594#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:54,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:54,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {6595#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:54,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:54,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {6596#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:54,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:54,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:54,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:54,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {6598#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:54,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:54,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {6599#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:54,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:54,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {6600#(<= |ULTIMATE.start_main_~i~1#1| 10)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:54,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:54,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {6601#(<= |ULTIMATE.start_main_~i~1#1| 11)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:54,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:54,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {6602#(<= |ULTIMATE.start_main_~i~1#1| 12)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:54,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:54,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {6603#(<= |ULTIMATE.start_main_~i~1#1| 13)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:54,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:54,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {6604#(<= |ULTIMATE.start_main_~i~1#1| 14)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:54,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:54,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {6605#(<= |ULTIMATE.start_main_~i~1#1| 15)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:54,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:54,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {6606#(<= |ULTIMATE.start_main_~i~1#1| 16)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:54,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:54,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {6607#(<= |ULTIMATE.start_main_~i~1#1| 17)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:54,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:54,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {6608#(<= |ULTIMATE.start_main_~i~1#1| 18)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:54,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:54,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {6609#(<= |ULTIMATE.start_main_~i~1#1| 19)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:54,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:54,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {6610#(<= |ULTIMATE.start_main_~i~1#1| 20)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:54,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:54,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {6611#(<= |ULTIMATE.start_main_~i~1#1| 21)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:54,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:54,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {6612#(<= |ULTIMATE.start_main_~i~1#1| 22)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:54,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {6613#(<= |ULTIMATE.start_main_~i~1#1| 23)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6614#(<= |ULTIMATE.start_main_~i~1#1| 24)} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {6614#(<= |ULTIMATE.start_main_~i~1#1| 24)} assume !(main_~i~1#1 < 100); {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L272 TraceCheckUtils]: 51: Hoare triple {6589#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {6589#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 59: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 67: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 68: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,053 INFO L290 TraceCheckUtils]: 71: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 77: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 79: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 80: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 81: Hoare triple {6589#false} assume !(~i~0 < 100); {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 82: Hoare triple {6589#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 83: Hoare triple {6589#false} assume true; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6589#false} {6589#false} #65#return; {6589#false} is VALID [2022-02-20 14:18:54,054 INFO L290 TraceCheckUtils]: 85: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L272 TraceCheckUtils]: 86: Hoare triple {6589#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 87: Hoare triple {6589#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 88: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 89: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 91: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 95: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 96: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 97: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 98: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 111: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,056 INFO L290 TraceCheckUtils]: 113: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 114: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 115: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 116: Hoare triple {6589#false} assume !(~i~0 < 100); {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {6589#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {6589#false} assume true; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {6589#false} {6589#false} #67#return; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 121: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 122: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 123: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 124: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 125: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 126: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:54,057 INFO L290 TraceCheckUtils]: 127: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 128: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 129: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 130: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 131: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 132: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 133: Hoare triple {6589#false} assume !(main_~i~2#1 < 99); {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 134: Hoare triple {6589#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L272 TraceCheckUtils]: 135: Hoare triple {6589#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 136: Hoare triple {6589#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 137: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 138: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 139: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 140: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,058 INFO L290 TraceCheckUtils]: 141: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 142: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 143: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 144: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 145: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 146: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 147: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 148: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 149: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 150: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 151: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 152: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 153: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 154: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,059 INFO L290 TraceCheckUtils]: 155: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 156: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 157: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 158: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 159: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 160: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 161: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 162: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 163: Hoare triple {6589#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 164: Hoare triple {6589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 165: Hoare triple {6589#false} assume !(~i~0 < 100); {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 166: Hoare triple {6589#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 167: Hoare triple {6589#false} assume true; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {6589#false} {6589#false} #69#return; {6589#false} is VALID [2022-02-20 14:18:54,060 INFO L290 TraceCheckUtils]: 169: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {6589#false} is VALID [2022-02-20 14:18:54,061 INFO L290 TraceCheckUtils]: 170: Hoare triple {6589#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {6589#false} is VALID [2022-02-20 14:18:54,061 INFO L290 TraceCheckUtils]: 171: Hoare triple {6589#false} assume !false; {6589#false} is VALID [2022-02-20 14:18:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2022-02-20 14:18:54,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:18:55,263 INFO L290 TraceCheckUtils]: 171: Hoare triple {6589#false} assume !false; {6589#false} is VALID [2022-02-20 14:18:55,263 INFO L290 TraceCheckUtils]: 170: Hoare triple {6589#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {6589#false} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 169: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {6589#false} is VALID [2022-02-20 14:18:55,264 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {6588#true} {6589#false} #69#return; {6589#false} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 167: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 166: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 165: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 164: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 163: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 162: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 161: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 160: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 159: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 158: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 157: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,264 INFO L290 TraceCheckUtils]: 156: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 155: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 154: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 153: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 152: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 151: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 150: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 149: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 148: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 147: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 146: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 145: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 144: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 143: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,265 INFO L290 TraceCheckUtils]: 142: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 141: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 140: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 139: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 138: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 137: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 136: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L272 TraceCheckUtils]: 135: Hoare triple {6589#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6588#true} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 134: Hoare triple {6589#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {6589#false} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 133: Hoare triple {6589#false} assume !(main_~i~2#1 < 99); {6589#false} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 132: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 131: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 130: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 129: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:55,266 INFO L290 TraceCheckUtils]: 128: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 127: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 126: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 125: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 124: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 123: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 122: Hoare triple {6589#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 121: Hoare triple {6589#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 120: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {6588#true} {6589#false} #67#return; {6589#false} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 118: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 117: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 116: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:55,267 INFO L290 TraceCheckUtils]: 115: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 114: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 113: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 112: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 111: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 110: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 109: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 100: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 99: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 98: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 97: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 96: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 95: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 94: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 93: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 92: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 91: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 89: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,269 INFO L290 TraceCheckUtils]: 87: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L272 TraceCheckUtils]: 86: Hoare triple {6589#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {6589#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {6589#false} is VALID [2022-02-20 14:18:55,270 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6588#true} {6589#false} #65#return; {6589#false} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 83: Hoare triple {6588#true} assume true; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {6588#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {6588#true} assume !(~i~0 < 100); {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 79: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 78: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 77: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 74: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 69: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 64: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 59: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {6588#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {6588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {6588#true} is VALID [2022-02-20 14:18:55,272 INFO L272 TraceCheckUtils]: 51: Hoare triple {6589#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {6588#true} is VALID [2022-02-20 14:18:55,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {7594#(< |ULTIMATE.start_main_~i~1#1| 100)} assume !(main_~i~1#1 < 100); {6589#false} is VALID [2022-02-20 14:18:55,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {7598#(< |ULTIMATE.start_main_~i~1#1| 99)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7594#(< |ULTIMATE.start_main_~i~1#1| 100)} is VALID [2022-02-20 14:18:55,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {7598#(< |ULTIMATE.start_main_~i~1#1| 99)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7598#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:55,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {7605#(< |ULTIMATE.start_main_~i~1#1| 98)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7598#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:18:55,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {7605#(< |ULTIMATE.start_main_~i~1#1| 98)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7605#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:18:55,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {7612#(< |ULTIMATE.start_main_~i~1#1| 97)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7605#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:18:55,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {7612#(< |ULTIMATE.start_main_~i~1#1| 97)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7612#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:18:55,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {7619#(< |ULTIMATE.start_main_~i~1#1| 96)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7612#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:18:55,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {7619#(< |ULTIMATE.start_main_~i~1#1| 96)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7619#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:18:55,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {7626#(< |ULTIMATE.start_main_~i~1#1| 95)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7619#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:18:55,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {7626#(< |ULTIMATE.start_main_~i~1#1| 95)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7626#(< |ULTIMATE.start_main_~i~1#1| 95)} is VALID [2022-02-20 14:18:55,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {7633#(< |ULTIMATE.start_main_~i~1#1| 94)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7626#(< |ULTIMATE.start_main_~i~1#1| 95)} is VALID [2022-02-20 14:18:55,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {7633#(< |ULTIMATE.start_main_~i~1#1| 94)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7633#(< |ULTIMATE.start_main_~i~1#1| 94)} is VALID [2022-02-20 14:18:55,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {7640#(< |ULTIMATE.start_main_~i~1#1| 93)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7633#(< |ULTIMATE.start_main_~i~1#1| 94)} is VALID [2022-02-20 14:18:55,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {7640#(< |ULTIMATE.start_main_~i~1#1| 93)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7640#(< |ULTIMATE.start_main_~i~1#1| 93)} is VALID [2022-02-20 14:18:55,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {7647#(< |ULTIMATE.start_main_~i~1#1| 92)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7640#(< |ULTIMATE.start_main_~i~1#1| 93)} is VALID [2022-02-20 14:18:55,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {7647#(< |ULTIMATE.start_main_~i~1#1| 92)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7647#(< |ULTIMATE.start_main_~i~1#1| 92)} is VALID [2022-02-20 14:18:55,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {7654#(< |ULTIMATE.start_main_~i~1#1| 91)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7647#(< |ULTIMATE.start_main_~i~1#1| 92)} is VALID [2022-02-20 14:18:55,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {7654#(< |ULTIMATE.start_main_~i~1#1| 91)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7654#(< |ULTIMATE.start_main_~i~1#1| 91)} is VALID [2022-02-20 14:18:55,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {7661#(< |ULTIMATE.start_main_~i~1#1| 90)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7654#(< |ULTIMATE.start_main_~i~1#1| 91)} is VALID [2022-02-20 14:18:55,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {7661#(< |ULTIMATE.start_main_~i~1#1| 90)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7661#(< |ULTIMATE.start_main_~i~1#1| 90)} is VALID [2022-02-20 14:18:55,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {7668#(< |ULTIMATE.start_main_~i~1#1| 89)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7661#(< |ULTIMATE.start_main_~i~1#1| 90)} is VALID [2022-02-20 14:18:55,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {7668#(< |ULTIMATE.start_main_~i~1#1| 89)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7668#(< |ULTIMATE.start_main_~i~1#1| 89)} is VALID [2022-02-20 14:18:55,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {7675#(< |ULTIMATE.start_main_~i~1#1| 88)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7668#(< |ULTIMATE.start_main_~i~1#1| 89)} is VALID [2022-02-20 14:18:55,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {7675#(< |ULTIMATE.start_main_~i~1#1| 88)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7675#(< |ULTIMATE.start_main_~i~1#1| 88)} is VALID [2022-02-20 14:18:55,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {7682#(< |ULTIMATE.start_main_~i~1#1| 87)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7675#(< |ULTIMATE.start_main_~i~1#1| 88)} is VALID [2022-02-20 14:18:55,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {7682#(< |ULTIMATE.start_main_~i~1#1| 87)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7682#(< |ULTIMATE.start_main_~i~1#1| 87)} is VALID [2022-02-20 14:18:55,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {7689#(< |ULTIMATE.start_main_~i~1#1| 86)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7682#(< |ULTIMATE.start_main_~i~1#1| 87)} is VALID [2022-02-20 14:18:55,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {7689#(< |ULTIMATE.start_main_~i~1#1| 86)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7689#(< |ULTIMATE.start_main_~i~1#1| 86)} is VALID [2022-02-20 14:18:55,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {7696#(< |ULTIMATE.start_main_~i~1#1| 85)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7689#(< |ULTIMATE.start_main_~i~1#1| 86)} is VALID [2022-02-20 14:18:55,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {7696#(< |ULTIMATE.start_main_~i~1#1| 85)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7696#(< |ULTIMATE.start_main_~i~1#1| 85)} is VALID [2022-02-20 14:18:55,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {7703#(< |ULTIMATE.start_main_~i~1#1| 84)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7696#(< |ULTIMATE.start_main_~i~1#1| 85)} is VALID [2022-02-20 14:18:55,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {7703#(< |ULTIMATE.start_main_~i~1#1| 84)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7703#(< |ULTIMATE.start_main_~i~1#1| 84)} is VALID [2022-02-20 14:18:55,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {7710#(< |ULTIMATE.start_main_~i~1#1| 83)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7703#(< |ULTIMATE.start_main_~i~1#1| 84)} is VALID [2022-02-20 14:18:55,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {7710#(< |ULTIMATE.start_main_~i~1#1| 83)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7710#(< |ULTIMATE.start_main_~i~1#1| 83)} is VALID [2022-02-20 14:18:55,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {7717#(< |ULTIMATE.start_main_~i~1#1| 82)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7710#(< |ULTIMATE.start_main_~i~1#1| 83)} is VALID [2022-02-20 14:18:55,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {7717#(< |ULTIMATE.start_main_~i~1#1| 82)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7717#(< |ULTIMATE.start_main_~i~1#1| 82)} is VALID [2022-02-20 14:18:55,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {7724#(< |ULTIMATE.start_main_~i~1#1| 81)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7717#(< |ULTIMATE.start_main_~i~1#1| 82)} is VALID [2022-02-20 14:18:55,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {7724#(< |ULTIMATE.start_main_~i~1#1| 81)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7724#(< |ULTIMATE.start_main_~i~1#1| 81)} is VALID [2022-02-20 14:18:55,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {7731#(< |ULTIMATE.start_main_~i~1#1| 80)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7724#(< |ULTIMATE.start_main_~i~1#1| 81)} is VALID [2022-02-20 14:18:55,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {7731#(< |ULTIMATE.start_main_~i~1#1| 80)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7731#(< |ULTIMATE.start_main_~i~1#1| 80)} is VALID [2022-02-20 14:18:55,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {7738#(< |ULTIMATE.start_main_~i~1#1| 79)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7731#(< |ULTIMATE.start_main_~i~1#1| 80)} is VALID [2022-02-20 14:18:55,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {7738#(< |ULTIMATE.start_main_~i~1#1| 79)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7738#(< |ULTIMATE.start_main_~i~1#1| 79)} is VALID [2022-02-20 14:18:55,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {7745#(< |ULTIMATE.start_main_~i~1#1| 78)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7738#(< |ULTIMATE.start_main_~i~1#1| 79)} is VALID [2022-02-20 14:18:55,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {7745#(< |ULTIMATE.start_main_~i~1#1| 78)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7745#(< |ULTIMATE.start_main_~i~1#1| 78)} is VALID [2022-02-20 14:18:55,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {7752#(< |ULTIMATE.start_main_~i~1#1| 77)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7745#(< |ULTIMATE.start_main_~i~1#1| 78)} is VALID [2022-02-20 14:18:55,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {7752#(< |ULTIMATE.start_main_~i~1#1| 77)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7752#(< |ULTIMATE.start_main_~i~1#1| 77)} is VALID [2022-02-20 14:18:55,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {7759#(< |ULTIMATE.start_main_~i~1#1| 76)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {7752#(< |ULTIMATE.start_main_~i~1#1| 77)} is VALID [2022-02-20 14:18:55,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {7759#(< |ULTIMATE.start_main_~i~1#1| 76)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {7759#(< |ULTIMATE.start_main_~i~1#1| 76)} is VALID [2022-02-20 14:18:55,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {7759#(< |ULTIMATE.start_main_~i~1#1| 76)} is VALID [2022-02-20 14:18:55,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {6588#true} is VALID [2022-02-20 14:18:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2022-02-20 14:18:55,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860129364] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:18:55,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:18:55,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2022-02-20 14:18:55,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133764831] [2022-02-20 14:18:55,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:18:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 172 [2022-02-20 14:18:55,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:18:55,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:55,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:55,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-02-20 14:18:55,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:18:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-02-20 14:18:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-02-20 14:18:55,429 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:55,750 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2022-02-20 14:18:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-20 14:18:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 172 [2022-02-20 14:18:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:18:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 172 transitions. [2022-02-20 14:18:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 172 transitions. [2022-02-20 14:18:55,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 172 transitions. [2022-02-20 14:18:55,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:18:55,893 INFO L225 Difference]: With dead ends: 215 [2022-02-20 14:18:55,893 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 14:18:55,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-02-20 14:18:55,895 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 75 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:18:55,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 134 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:18:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 14:18:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-02-20 14:18:55,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:18:55,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:55,965 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:55,965 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:55,969 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-02-20 14:18:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-02-20 14:18:55,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:55,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:55,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 159 states. [2022-02-20 14:18:55,970 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 159 states. [2022-02-20 14:18:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:18:55,973 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-02-20 14:18:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-02-20 14:18:55,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:18:55,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:18:55,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:18:55,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:18:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0194805194805194) internal successors, (157), 154 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:18:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2022-02-20 14:18:55,980 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 172 [2022-02-20 14:18:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:18:55,980 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2022-02-20 14:18:55,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.358490566037736) internal successors, (125), 53 states have internal predecessors, (125), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:18:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-02-20 14:18:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-02-20 14:18:55,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:18:55,983 INFO L514 BasicCegarLoop]: trace histogram [50, 50, 42, 42, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:18:56,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 14:18:56,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 14:18:56,201 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:18:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:18:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -503255561, now seen corresponding path program 8 times [2022-02-20 14:18:56,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:18:56,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763648170] [2022-02-20 14:18:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:18:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:18:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-02-20 14:18:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:57,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:18:57,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:18:57,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:18:57,534 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8640#true} {8641#false} #65#return; {8641#false} is VALID [2022-02-20 14:18:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-02-20 14:18:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:18:57,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:18:57,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:18:57,555 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8640#true} {8641#false} #67#return; {8641#false} is VALID [2022-02-20 14:18:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-02-20 14:18:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:57,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:18:57,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:18:57,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:18:57,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:18:57,579 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8640#true} {8641#false} #69#return; {8641#false} is VALID [2022-02-20 14:18:57,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {8640#true} is VALID [2022-02-20 14:18:57,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {8640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {8642#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:57,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {8642#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8642#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:57,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {8642#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:57,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:57,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:57,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:57,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:57,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:57,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:57,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:57,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:57,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:57,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:57,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:57,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:57,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:57,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:57,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:57,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:57,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:57,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:57,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:57,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:57,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:57,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:57,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:57,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:57,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:57,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:57,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:57,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:57,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:57,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:57,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:57,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:57,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:57,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:57,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:57,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:57,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:57,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:57,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:57,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:57,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:57,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:57,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:57,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:57,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:57,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} is VALID [2022-02-20 14:18:57,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} is VALID [2022-02-20 14:18:57,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} is VALID [2022-02-20 14:18:57,604 INFO L290 TraceCheckUtils]: 52: Hoare triple {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} is VALID [2022-02-20 14:18:57,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} is VALID [2022-02-20 14:18:57,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} is VALID [2022-02-20 14:18:57,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} is VALID [2022-02-20 14:18:57,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} is VALID [2022-02-20 14:18:57,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} is VALID [2022-02-20 14:18:57,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} is VALID [2022-02-20 14:18:57,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} is VALID [2022-02-20 14:18:57,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} is VALID [2022-02-20 14:18:57,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} is VALID [2022-02-20 14:18:57,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} is VALID [2022-02-20 14:18:57,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} is VALID [2022-02-20 14:18:57,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} is VALID [2022-02-20 14:18:57,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} is VALID [2022-02-20 14:18:57,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} is VALID [2022-02-20 14:18:57,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} is VALID [2022-02-20 14:18:57,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} is VALID [2022-02-20 14:18:57,610 INFO L290 TraceCheckUtils]: 69: Hoare triple {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} is VALID [2022-02-20 14:18:57,610 INFO L290 TraceCheckUtils]: 70: Hoare triple {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} is VALID [2022-02-20 14:18:57,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} is VALID [2022-02-20 14:18:57,611 INFO L290 TraceCheckUtils]: 72: Hoare triple {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} is VALID [2022-02-20 14:18:57,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} is VALID [2022-02-20 14:18:57,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} is VALID [2022-02-20 14:18:57,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} is VALID [2022-02-20 14:18:57,613 INFO L290 TraceCheckUtils]: 76: Hoare triple {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} is VALID [2022-02-20 14:18:57,613 INFO L290 TraceCheckUtils]: 77: Hoare triple {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} is VALID [2022-02-20 14:18:57,613 INFO L290 TraceCheckUtils]: 78: Hoare triple {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} is VALID [2022-02-20 14:18:57,614 INFO L290 TraceCheckUtils]: 79: Hoare triple {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} is VALID [2022-02-20 14:18:57,614 INFO L290 TraceCheckUtils]: 80: Hoare triple {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} is VALID [2022-02-20 14:18:57,614 INFO L290 TraceCheckUtils]: 81: Hoare triple {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} is VALID [2022-02-20 14:18:57,615 INFO L290 TraceCheckUtils]: 82: Hoare triple {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} is VALID [2022-02-20 14:18:57,615 INFO L290 TraceCheckUtils]: 83: Hoare triple {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} is VALID [2022-02-20 14:18:57,616 INFO L290 TraceCheckUtils]: 84: Hoare triple {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} is VALID [2022-02-20 14:18:57,616 INFO L290 TraceCheckUtils]: 85: Hoare triple {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} is VALID [2022-02-20 14:18:57,616 INFO L290 TraceCheckUtils]: 86: Hoare triple {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} is VALID [2022-02-20 14:18:57,617 INFO L290 TraceCheckUtils]: 87: Hoare triple {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} is VALID [2022-02-20 14:18:57,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} is VALID [2022-02-20 14:18:57,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} is VALID [2022-02-20 14:18:57,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} is VALID [2022-02-20 14:18:57,618 INFO L290 TraceCheckUtils]: 91: Hoare triple {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} is VALID [2022-02-20 14:18:57,618 INFO L290 TraceCheckUtils]: 92: Hoare triple {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} is VALID [2022-02-20 14:18:57,619 INFO L290 TraceCheckUtils]: 93: Hoare triple {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} is VALID [2022-02-20 14:18:57,619 INFO L290 TraceCheckUtils]: 94: Hoare triple {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} is VALID [2022-02-20 14:18:57,620 INFO L290 TraceCheckUtils]: 95: Hoare triple {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} is VALID [2022-02-20 14:18:57,620 INFO L290 TraceCheckUtils]: 96: Hoare triple {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} is VALID [2022-02-20 14:18:57,620 INFO L290 TraceCheckUtils]: 97: Hoare triple {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} is VALID [2022-02-20 14:18:57,621 INFO L290 TraceCheckUtils]: 98: Hoare triple {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} is VALID [2022-02-20 14:18:57,621 INFO L290 TraceCheckUtils]: 99: Hoare triple {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} is VALID [2022-02-20 14:18:57,621 INFO L290 TraceCheckUtils]: 100: Hoare triple {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} is VALID [2022-02-20 14:18:57,622 INFO L290 TraceCheckUtils]: 101: Hoare triple {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} is VALID [2022-02-20 14:18:57,622 INFO L290 TraceCheckUtils]: 102: Hoare triple {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} assume !(main_~i~1#1 < 100); {8641#false} is VALID [2022-02-20 14:18:57,622 INFO L272 TraceCheckUtils]: 103: Hoare triple {8641#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8640#true} is VALID [2022-02-20 14:18:57,622 INFO L290 TraceCheckUtils]: 104: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:18:57,622 INFO L290 TraceCheckUtils]: 105: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 106: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 107: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 108: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 109: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 110: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 111: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 112: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 113: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 114: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,623 INFO L290 TraceCheckUtils]: 115: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 116: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 117: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 118: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 119: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 120: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 121: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 122: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 123: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 124: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,624 INFO L290 TraceCheckUtils]: 125: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 126: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 127: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 128: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 129: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 130: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 131: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 132: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 133: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 134: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:18:57,625 INFO L290 TraceCheckUtils]: 135: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {8640#true} {8641#false} #65#return; {8641#false} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 137: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {8641#false} is VALID [2022-02-20 14:18:57,626 INFO L272 TraceCheckUtils]: 138: Hoare triple {8641#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 139: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 140: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 141: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 142: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 143: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,626 INFO L290 TraceCheckUtils]: 144: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 145: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 146: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 147: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 148: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 149: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 150: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 151: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 152: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 153: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,627 INFO L290 TraceCheckUtils]: 154: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 155: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 156: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 157: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 158: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 159: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 160: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 161: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 162: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 163: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,628 INFO L290 TraceCheckUtils]: 164: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 165: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 166: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 167: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 168: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 169: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 170: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:18:57,629 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {8640#true} {8641#false} #67#return; {8641#false} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 172: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {8641#false} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 173: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:57,629 INFO L290 TraceCheckUtils]: 174: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 175: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 176: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 177: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 178: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 179: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 180: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 181: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 182: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 183: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:57,630 INFO L290 TraceCheckUtils]: 184: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 185: Hoare triple {8641#false} assume !(main_~i~2#1 < 99); {8641#false} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 186: Hoare triple {8641#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {8641#false} is VALID [2022-02-20 14:18:57,631 INFO L272 TraceCheckUtils]: 187: Hoare triple {8641#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 188: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 189: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 190: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 191: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 192: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 193: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,631 INFO L290 TraceCheckUtils]: 194: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 195: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 196: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 197: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 198: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 199: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 200: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 201: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 202: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 203: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,632 INFO L290 TraceCheckUtils]: 204: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 205: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 206: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 207: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 208: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 209: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 210: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 211: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 212: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 213: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,633 INFO L290 TraceCheckUtils]: 214: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 215: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 216: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 217: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 218: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 219: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:18:57,634 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {8640#true} {8641#false} #69#return; {8641#false} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 221: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {8641#false} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 222: Hoare triple {8641#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {8641#false} is VALID [2022-02-20 14:18:57,634 INFO L290 TraceCheckUtils]: 223: Hoare triple {8641#false} assume !false; {8641#false} is VALID [2022-02-20 14:18:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2022-02-20 14:18:57,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:18:57,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763648170] [2022-02-20 14:18:57,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763648170] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:18:57,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640071431] [2022-02-20 14:18:57,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:18:57,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:18:57,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:18:57,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:18:57,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 14:18:57,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:18:57,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:18:57,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 14:18:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:18:58,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:18:58,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {8640#true} is VALID [2022-02-20 14:18:58,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {8640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {8798#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:58,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {8798#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8798#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:18:58,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {8798#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:58,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:18:58,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {8643#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:58,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:18:58,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {8644#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:58,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:18:58,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {8645#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:58,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:18:58,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {8646#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:58,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:18:58,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {8647#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:58,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:18:58,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {8648#(<= |ULTIMATE.start_main_~i~1#1| 6)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:58,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 14:18:58,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {8649#(<= |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:58,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 14:18:58,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {8650#(<= |ULTIMATE.start_main_~i~1#1| 8)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:58,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} is VALID [2022-02-20 14:18:58,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {8651#(<= |ULTIMATE.start_main_~i~1#1| 9)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:58,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} is VALID [2022-02-20 14:18:58,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {8652#(<= |ULTIMATE.start_main_~i~1#1| 10)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:58,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} is VALID [2022-02-20 14:18:58,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {8653#(<= |ULTIMATE.start_main_~i~1#1| 11)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:58,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} is VALID [2022-02-20 14:18:58,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {8654#(<= |ULTIMATE.start_main_~i~1#1| 12)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:58,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} is VALID [2022-02-20 14:18:58,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {8655#(<= |ULTIMATE.start_main_~i~1#1| 13)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:58,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} is VALID [2022-02-20 14:18:58,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {8656#(<= |ULTIMATE.start_main_~i~1#1| 14)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:58,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} is VALID [2022-02-20 14:18:58,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {8657#(<= |ULTIMATE.start_main_~i~1#1| 15)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:58,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} is VALID [2022-02-20 14:18:58,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(<= |ULTIMATE.start_main_~i~1#1| 16)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:58,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} is VALID [2022-02-20 14:18:58,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {8659#(<= |ULTIMATE.start_main_~i~1#1| 17)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:58,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} is VALID [2022-02-20 14:18:58,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {8660#(<= |ULTIMATE.start_main_~i~1#1| 18)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:58,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} is VALID [2022-02-20 14:18:58,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {8661#(<= |ULTIMATE.start_main_~i~1#1| 19)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:58,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} is VALID [2022-02-20 14:18:58,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {8662#(<= |ULTIMATE.start_main_~i~1#1| 20)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:58,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} is VALID [2022-02-20 14:18:58,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {8663#(<= |ULTIMATE.start_main_~i~1#1| 21)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:58,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} is VALID [2022-02-20 14:18:58,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {8664#(<= |ULTIMATE.start_main_~i~1#1| 22)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:58,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} is VALID [2022-02-20 14:18:58,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(<= |ULTIMATE.start_main_~i~1#1| 23)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} is VALID [2022-02-20 14:18:58,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} is VALID [2022-02-20 14:18:58,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {8666#(<= |ULTIMATE.start_main_~i~1#1| 24)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} is VALID [2022-02-20 14:18:58,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} is VALID [2022-02-20 14:18:58,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {8667#(<= |ULTIMATE.start_main_~i~1#1| 25)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} is VALID [2022-02-20 14:18:58,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} is VALID [2022-02-20 14:18:58,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {8668#(<= |ULTIMATE.start_main_~i~1#1| 26)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} is VALID [2022-02-20 14:18:58,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} is VALID [2022-02-20 14:18:58,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {8669#(<= |ULTIMATE.start_main_~i~1#1| 27)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} is VALID [2022-02-20 14:18:58,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} is VALID [2022-02-20 14:18:58,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {8670#(<= |ULTIMATE.start_main_~i~1#1| 28)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} is VALID [2022-02-20 14:18:58,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} is VALID [2022-02-20 14:18:58,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {8671#(<= |ULTIMATE.start_main_~i~1#1| 29)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} is VALID [2022-02-20 14:18:58,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} is VALID [2022-02-20 14:18:58,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {8672#(<= |ULTIMATE.start_main_~i~1#1| 30)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} is VALID [2022-02-20 14:18:58,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} is VALID [2022-02-20 14:18:58,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {8673#(<= |ULTIMATE.start_main_~i~1#1| 31)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} is VALID [2022-02-20 14:18:58,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} is VALID [2022-02-20 14:18:58,973 INFO L290 TraceCheckUtils]: 67: Hoare triple {8674#(<= |ULTIMATE.start_main_~i~1#1| 32)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} is VALID [2022-02-20 14:18:58,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} is VALID [2022-02-20 14:18:58,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {8675#(<= |ULTIMATE.start_main_~i~1#1| 33)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} is VALID [2022-02-20 14:18:58,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} is VALID [2022-02-20 14:18:58,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {8676#(<= |ULTIMATE.start_main_~i~1#1| 34)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} is VALID [2022-02-20 14:18:58,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} is VALID [2022-02-20 14:18:58,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {8677#(<= |ULTIMATE.start_main_~i~1#1| 35)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} is VALID [2022-02-20 14:18:58,991 INFO L290 TraceCheckUtils]: 74: Hoare triple {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} is VALID [2022-02-20 14:18:58,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {8678#(<= |ULTIMATE.start_main_~i~1#1| 36)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} is VALID [2022-02-20 14:18:58,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} is VALID [2022-02-20 14:18:58,993 INFO L290 TraceCheckUtils]: 77: Hoare triple {8679#(<= |ULTIMATE.start_main_~i~1#1| 37)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} is VALID [2022-02-20 14:18:58,993 INFO L290 TraceCheckUtils]: 78: Hoare triple {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} is VALID [2022-02-20 14:18:58,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {8680#(<= |ULTIMATE.start_main_~i~1#1| 38)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} is VALID [2022-02-20 14:18:58,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} is VALID [2022-02-20 14:18:58,994 INFO L290 TraceCheckUtils]: 81: Hoare triple {8681#(<= |ULTIMATE.start_main_~i~1#1| 39)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} is VALID [2022-02-20 14:18:58,995 INFO L290 TraceCheckUtils]: 82: Hoare triple {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} is VALID [2022-02-20 14:18:58,995 INFO L290 TraceCheckUtils]: 83: Hoare triple {8682#(<= |ULTIMATE.start_main_~i~1#1| 40)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} is VALID [2022-02-20 14:18:58,995 INFO L290 TraceCheckUtils]: 84: Hoare triple {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} is VALID [2022-02-20 14:18:58,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {8683#(<= |ULTIMATE.start_main_~i~1#1| 41)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} is VALID [2022-02-20 14:18:58,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} is VALID [2022-02-20 14:18:58,997 INFO L290 TraceCheckUtils]: 87: Hoare triple {8684#(<= |ULTIMATE.start_main_~i~1#1| 42)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} is VALID [2022-02-20 14:18:58,997 INFO L290 TraceCheckUtils]: 88: Hoare triple {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} is VALID [2022-02-20 14:18:58,998 INFO L290 TraceCheckUtils]: 89: Hoare triple {8685#(<= |ULTIMATE.start_main_~i~1#1| 43)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} is VALID [2022-02-20 14:18:58,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} is VALID [2022-02-20 14:18:58,998 INFO L290 TraceCheckUtils]: 91: Hoare triple {8686#(<= |ULTIMATE.start_main_~i~1#1| 44)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} is VALID [2022-02-20 14:18:58,999 INFO L290 TraceCheckUtils]: 92: Hoare triple {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} is VALID [2022-02-20 14:18:58,999 INFO L290 TraceCheckUtils]: 93: Hoare triple {8687#(<= |ULTIMATE.start_main_~i~1#1| 45)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} is VALID [2022-02-20 14:18:59,001 INFO L290 TraceCheckUtils]: 94: Hoare triple {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} is VALID [2022-02-20 14:18:59,001 INFO L290 TraceCheckUtils]: 95: Hoare triple {8688#(<= |ULTIMATE.start_main_~i~1#1| 46)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} is VALID [2022-02-20 14:18:59,001 INFO L290 TraceCheckUtils]: 96: Hoare triple {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} is VALID [2022-02-20 14:18:59,002 INFO L290 TraceCheckUtils]: 97: Hoare triple {8689#(<= |ULTIMATE.start_main_~i~1#1| 47)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} is VALID [2022-02-20 14:18:59,003 INFO L290 TraceCheckUtils]: 98: Hoare triple {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} is VALID [2022-02-20 14:18:59,003 INFO L290 TraceCheckUtils]: 99: Hoare triple {8690#(<= |ULTIMATE.start_main_~i~1#1| 48)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} is VALID [2022-02-20 14:18:59,012 INFO L290 TraceCheckUtils]: 100: Hoare triple {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} is VALID [2022-02-20 14:18:59,015 INFO L290 TraceCheckUtils]: 101: Hoare triple {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} is VALID [2022-02-20 14:18:59,015 INFO L290 TraceCheckUtils]: 102: Hoare triple {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} assume !(main_~i~1#1 < 100); {8641#false} is VALID [2022-02-20 14:18:59,015 INFO L272 TraceCheckUtils]: 103: Hoare triple {8641#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8641#false} is VALID [2022-02-20 14:18:59,015 INFO L290 TraceCheckUtils]: 104: Hoare triple {8641#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8641#false} is VALID [2022-02-20 14:18:59,015 INFO L290 TraceCheckUtils]: 105: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,015 INFO L290 TraceCheckUtils]: 106: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 107: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 108: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 109: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 110: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 111: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 112: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 113: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 114: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 115: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,016 INFO L290 TraceCheckUtils]: 116: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 117: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 118: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 119: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 120: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 121: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 122: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 123: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 124: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 125: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 126: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 127: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 128: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,017 INFO L290 TraceCheckUtils]: 129: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,018 INFO L290 TraceCheckUtils]: 130: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,018 INFO L290 TraceCheckUtils]: 131: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,018 INFO L290 TraceCheckUtils]: 132: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,018 INFO L290 TraceCheckUtils]: 133: Hoare triple {8641#false} assume !(~i~0 < 100); {8641#false} is VALID [2022-02-20 14:18:59,018 INFO L290 TraceCheckUtils]: 134: Hoare triple {8641#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8641#false} is VALID [2022-02-20 14:18:59,018 INFO L290 TraceCheckUtils]: 135: Hoare triple {8641#false} assume true; {8641#false} is VALID [2022-02-20 14:18:59,019 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {8641#false} {8641#false} #65#return; {8641#false} is VALID [2022-02-20 14:18:59,019 INFO L290 TraceCheckUtils]: 137: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {8641#false} is VALID [2022-02-20 14:18:59,019 INFO L272 TraceCheckUtils]: 138: Hoare triple {8641#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8641#false} is VALID [2022-02-20 14:18:59,019 INFO L290 TraceCheckUtils]: 139: Hoare triple {8641#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8641#false} is VALID [2022-02-20 14:18:59,019 INFO L290 TraceCheckUtils]: 140: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,020 INFO L290 TraceCheckUtils]: 141: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,020 INFO L290 TraceCheckUtils]: 142: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,020 INFO L290 TraceCheckUtils]: 143: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,020 INFO L290 TraceCheckUtils]: 144: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,030 INFO L290 TraceCheckUtils]: 145: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,030 INFO L290 TraceCheckUtils]: 146: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,030 INFO L290 TraceCheckUtils]: 147: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,030 INFO L290 TraceCheckUtils]: 148: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 149: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 150: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 151: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 152: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 153: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 154: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,031 INFO L290 TraceCheckUtils]: 155: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,032 INFO L290 TraceCheckUtils]: 156: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,032 INFO L290 TraceCheckUtils]: 157: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,032 INFO L290 TraceCheckUtils]: 158: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,032 INFO L290 TraceCheckUtils]: 159: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,032 INFO L290 TraceCheckUtils]: 160: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,032 INFO L290 TraceCheckUtils]: 161: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,033 INFO L290 TraceCheckUtils]: 162: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,033 INFO L290 TraceCheckUtils]: 163: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,033 INFO L290 TraceCheckUtils]: 164: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,033 INFO L290 TraceCheckUtils]: 165: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,033 INFO L290 TraceCheckUtils]: 166: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,033 INFO L290 TraceCheckUtils]: 167: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,034 INFO L290 TraceCheckUtils]: 168: Hoare triple {8641#false} assume !(~i~0 < 100); {8641#false} is VALID [2022-02-20 14:18:59,034 INFO L290 TraceCheckUtils]: 169: Hoare triple {8641#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8641#false} is VALID [2022-02-20 14:18:59,034 INFO L290 TraceCheckUtils]: 170: Hoare triple {8641#false} assume true; {8641#false} is VALID [2022-02-20 14:18:59,034 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {8641#false} {8641#false} #67#return; {8641#false} is VALID [2022-02-20 14:18:59,034 INFO L290 TraceCheckUtils]: 172: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {8641#false} is VALID [2022-02-20 14:18:59,034 INFO L290 TraceCheckUtils]: 173: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:59,035 INFO L290 TraceCheckUtils]: 174: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:59,035 INFO L290 TraceCheckUtils]: 175: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:59,035 INFO L290 TraceCheckUtils]: 176: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:59,035 INFO L290 TraceCheckUtils]: 177: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:59,035 INFO L290 TraceCheckUtils]: 178: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:59,035 INFO L290 TraceCheckUtils]: 179: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 180: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 181: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 182: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 183: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 184: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 185: Hoare triple {8641#false} assume !(main_~i~2#1 < 99); {8641#false} is VALID [2022-02-20 14:18:59,036 INFO L290 TraceCheckUtils]: 186: Hoare triple {8641#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {8641#false} is VALID [2022-02-20 14:18:59,037 INFO L272 TraceCheckUtils]: 187: Hoare triple {8641#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8641#false} is VALID [2022-02-20 14:18:59,037 INFO L290 TraceCheckUtils]: 188: Hoare triple {8641#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8641#false} is VALID [2022-02-20 14:18:59,037 INFO L290 TraceCheckUtils]: 189: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,037 INFO L290 TraceCheckUtils]: 190: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,037 INFO L290 TraceCheckUtils]: 191: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,037 INFO L290 TraceCheckUtils]: 192: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,038 INFO L290 TraceCheckUtils]: 193: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,038 INFO L290 TraceCheckUtils]: 194: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,038 INFO L290 TraceCheckUtils]: 195: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,038 INFO L290 TraceCheckUtils]: 196: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,038 INFO L290 TraceCheckUtils]: 197: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,038 INFO L290 TraceCheckUtils]: 198: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,039 INFO L290 TraceCheckUtils]: 199: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,039 INFO L290 TraceCheckUtils]: 200: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,039 INFO L290 TraceCheckUtils]: 201: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,039 INFO L290 TraceCheckUtils]: 202: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,039 INFO L290 TraceCheckUtils]: 203: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,039 INFO L290 TraceCheckUtils]: 204: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 205: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 206: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 207: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 208: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 209: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 210: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,040 INFO L290 TraceCheckUtils]: 211: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,041 INFO L290 TraceCheckUtils]: 212: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,041 INFO L290 TraceCheckUtils]: 213: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,041 INFO L290 TraceCheckUtils]: 214: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,041 INFO L290 TraceCheckUtils]: 215: Hoare triple {8641#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8641#false} is VALID [2022-02-20 14:18:59,041 INFO L290 TraceCheckUtils]: 216: Hoare triple {8641#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8641#false} is VALID [2022-02-20 14:18:59,041 INFO L290 TraceCheckUtils]: 217: Hoare triple {8641#false} assume !(~i~0 < 100); {8641#false} is VALID [2022-02-20 14:18:59,042 INFO L290 TraceCheckUtils]: 218: Hoare triple {8641#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8641#false} is VALID [2022-02-20 14:18:59,042 INFO L290 TraceCheckUtils]: 219: Hoare triple {8641#false} assume true; {8641#false} is VALID [2022-02-20 14:18:59,042 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {8641#false} {8641#false} #69#return; {8641#false} is VALID [2022-02-20 14:18:59,042 INFO L290 TraceCheckUtils]: 221: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {8641#false} is VALID [2022-02-20 14:18:59,042 INFO L290 TraceCheckUtils]: 222: Hoare triple {8641#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {8641#false} is VALID [2022-02-20 14:18:59,042 INFO L290 TraceCheckUtils]: 223: Hoare triple {8641#false} assume !false; {8641#false} is VALID [2022-02-20 14:18:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2022-02-20 14:18:59,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:19:02,460 INFO L290 TraceCheckUtils]: 223: Hoare triple {8641#false} assume !false; {8641#false} is VALID [2022-02-20 14:19:02,460 INFO L290 TraceCheckUtils]: 222: Hoare triple {8641#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {8641#false} is VALID [2022-02-20 14:19:02,460 INFO L290 TraceCheckUtils]: 221: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {8641#false} is VALID [2022-02-20 14:19:02,461 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {8640#true} {8641#false} #69#return; {8641#false} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 219: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 218: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 217: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 216: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 215: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 214: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 213: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 212: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 211: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 210: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 209: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 208: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,461 INFO L290 TraceCheckUtils]: 207: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 206: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 205: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 204: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 203: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 202: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 201: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 200: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 199: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 198: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 197: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,462 INFO L290 TraceCheckUtils]: 196: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 195: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 194: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 193: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 192: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 191: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 190: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,463 INFO L290 TraceCheckUtils]: 189: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,464 INFO L290 TraceCheckUtils]: 188: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:19:02,464 INFO L272 TraceCheckUtils]: 187: Hoare triple {8641#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8640#true} is VALID [2022-02-20 14:19:02,464 INFO L290 TraceCheckUtils]: 186: Hoare triple {8641#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {8641#false} is VALID [2022-02-20 14:19:02,464 INFO L290 TraceCheckUtils]: 185: Hoare triple {8641#false} assume !(main_~i~2#1 < 99); {8641#false} is VALID [2022-02-20 14:19:02,464 INFO L290 TraceCheckUtils]: 184: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:19:02,464 INFO L290 TraceCheckUtils]: 183: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:19:02,464 INFO L290 TraceCheckUtils]: 182: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:19:02,465 INFO L290 TraceCheckUtils]: 181: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:19:02,465 INFO L290 TraceCheckUtils]: 180: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:19:02,465 INFO L290 TraceCheckUtils]: 179: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:19:02,465 INFO L290 TraceCheckUtils]: 178: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:19:02,465 INFO L290 TraceCheckUtils]: 177: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:19:02,465 INFO L290 TraceCheckUtils]: 176: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:19:02,466 INFO L290 TraceCheckUtils]: 175: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:19:02,466 INFO L290 TraceCheckUtils]: 174: Hoare triple {8641#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {8641#false} is VALID [2022-02-20 14:19:02,466 INFO L290 TraceCheckUtils]: 173: Hoare triple {8641#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {8641#false} is VALID [2022-02-20 14:19:02,466 INFO L290 TraceCheckUtils]: 172: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {8641#false} is VALID [2022-02-20 14:19:02,466 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {8640#true} {8641#false} #67#return; {8641#false} is VALID [2022-02-20 14:19:02,466 INFO L290 TraceCheckUtils]: 170: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:19:02,466 INFO L290 TraceCheckUtils]: 169: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 168: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 167: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 166: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 165: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 164: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 163: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,467 INFO L290 TraceCheckUtils]: 162: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 161: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 160: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 159: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 158: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 157: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 156: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,468 INFO L290 TraceCheckUtils]: 155: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,469 INFO L290 TraceCheckUtils]: 154: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,469 INFO L290 TraceCheckUtils]: 153: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,469 INFO L290 TraceCheckUtils]: 152: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,469 INFO L290 TraceCheckUtils]: 151: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,469 INFO L290 TraceCheckUtils]: 150: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,469 INFO L290 TraceCheckUtils]: 149: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 148: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 147: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 146: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 145: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 144: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 143: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,470 INFO L290 TraceCheckUtils]: 142: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,471 INFO L290 TraceCheckUtils]: 141: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,471 INFO L290 TraceCheckUtils]: 140: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,471 INFO L290 TraceCheckUtils]: 139: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:19:02,471 INFO L272 TraceCheckUtils]: 138: Hoare triple {8641#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8640#true} is VALID [2022-02-20 14:19:02,471 INFO L290 TraceCheckUtils]: 137: Hoare triple {8641#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {8641#false} is VALID [2022-02-20 14:19:02,471 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {8640#true} {8641#false} #65#return; {8641#false} is VALID [2022-02-20 14:19:02,471 INFO L290 TraceCheckUtils]: 135: Hoare triple {8640#true} assume true; {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 134: Hoare triple {8640#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {8640#true} assume !(~i~0 < 100); {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 130: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 129: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,472 INFO L290 TraceCheckUtils]: 128: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 127: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 126: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 125: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 124: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 123: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 122: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,473 INFO L290 TraceCheckUtils]: 121: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,474 INFO L290 TraceCheckUtils]: 120: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,474 INFO L290 TraceCheckUtils]: 119: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,474 INFO L290 TraceCheckUtils]: 118: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,474 INFO L290 TraceCheckUtils]: 116: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,474 INFO L290 TraceCheckUtils]: 115: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 114: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 113: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 112: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 110: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 109: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,476 INFO L290 TraceCheckUtils]: 107: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,476 INFO L290 TraceCheckUtils]: 106: Hoare triple {8640#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8640#true} is VALID [2022-02-20 14:19:02,476 INFO L290 TraceCheckUtils]: 105: Hoare triple {8640#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {8640#true} is VALID [2022-02-20 14:19:02,476 INFO L290 TraceCheckUtils]: 104: Hoare triple {8640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {8640#true} is VALID [2022-02-20 14:19:02,476 INFO L272 TraceCheckUtils]: 103: Hoare triple {8641#false} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {8640#true} is VALID [2022-02-20 14:19:02,477 INFO L290 TraceCheckUtils]: 102: Hoare triple {9828#(< |ULTIMATE.start_main_~i~1#1| 100)} assume !(main_~i~1#1 < 100); {8641#false} is VALID [2022-02-20 14:19:02,477 INFO L290 TraceCheckUtils]: 101: Hoare triple {9832#(< |ULTIMATE.start_main_~i~1#1| 99)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9828#(< |ULTIMATE.start_main_~i~1#1| 100)} is VALID [2022-02-20 14:19:02,477 INFO L290 TraceCheckUtils]: 100: Hoare triple {9832#(< |ULTIMATE.start_main_~i~1#1| 99)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9832#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:19:02,478 INFO L290 TraceCheckUtils]: 99: Hoare triple {9839#(< |ULTIMATE.start_main_~i~1#1| 98)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9832#(< |ULTIMATE.start_main_~i~1#1| 99)} is VALID [2022-02-20 14:19:02,478 INFO L290 TraceCheckUtils]: 98: Hoare triple {9839#(< |ULTIMATE.start_main_~i~1#1| 98)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9839#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:19:02,479 INFO L290 TraceCheckUtils]: 97: Hoare triple {9846#(< |ULTIMATE.start_main_~i~1#1| 97)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9839#(< |ULTIMATE.start_main_~i~1#1| 98)} is VALID [2022-02-20 14:19:02,479 INFO L290 TraceCheckUtils]: 96: Hoare triple {9846#(< |ULTIMATE.start_main_~i~1#1| 97)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9846#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:19:02,480 INFO L290 TraceCheckUtils]: 95: Hoare triple {9853#(< |ULTIMATE.start_main_~i~1#1| 96)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9846#(< |ULTIMATE.start_main_~i~1#1| 97)} is VALID [2022-02-20 14:19:02,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {9853#(< |ULTIMATE.start_main_~i~1#1| 96)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9853#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:19:02,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {9860#(< |ULTIMATE.start_main_~i~1#1| 95)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9853#(< |ULTIMATE.start_main_~i~1#1| 96)} is VALID [2022-02-20 14:19:02,481 INFO L290 TraceCheckUtils]: 92: Hoare triple {9860#(< |ULTIMATE.start_main_~i~1#1| 95)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9860#(< |ULTIMATE.start_main_~i~1#1| 95)} is VALID [2022-02-20 14:19:02,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {9867#(< |ULTIMATE.start_main_~i~1#1| 94)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9860#(< |ULTIMATE.start_main_~i~1#1| 95)} is VALID [2022-02-20 14:19:02,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {9867#(< |ULTIMATE.start_main_~i~1#1| 94)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9867#(< |ULTIMATE.start_main_~i~1#1| 94)} is VALID [2022-02-20 14:19:02,482 INFO L290 TraceCheckUtils]: 89: Hoare triple {9874#(< |ULTIMATE.start_main_~i~1#1| 93)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9867#(< |ULTIMATE.start_main_~i~1#1| 94)} is VALID [2022-02-20 14:19:02,482 INFO L290 TraceCheckUtils]: 88: Hoare triple {9874#(< |ULTIMATE.start_main_~i~1#1| 93)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9874#(< |ULTIMATE.start_main_~i~1#1| 93)} is VALID [2022-02-20 14:19:02,482 INFO L290 TraceCheckUtils]: 87: Hoare triple {9881#(< |ULTIMATE.start_main_~i~1#1| 92)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9874#(< |ULTIMATE.start_main_~i~1#1| 93)} is VALID [2022-02-20 14:19:02,483 INFO L290 TraceCheckUtils]: 86: Hoare triple {9881#(< |ULTIMATE.start_main_~i~1#1| 92)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9881#(< |ULTIMATE.start_main_~i~1#1| 92)} is VALID [2022-02-20 14:19:02,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {9888#(< |ULTIMATE.start_main_~i~1#1| 91)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9881#(< |ULTIMATE.start_main_~i~1#1| 92)} is VALID [2022-02-20 14:19:02,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {9888#(< |ULTIMATE.start_main_~i~1#1| 91)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9888#(< |ULTIMATE.start_main_~i~1#1| 91)} is VALID [2022-02-20 14:19:02,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {9895#(< |ULTIMATE.start_main_~i~1#1| 90)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9888#(< |ULTIMATE.start_main_~i~1#1| 91)} is VALID [2022-02-20 14:19:02,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {9895#(< |ULTIMATE.start_main_~i~1#1| 90)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9895#(< |ULTIMATE.start_main_~i~1#1| 90)} is VALID [2022-02-20 14:19:02,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {9902#(< |ULTIMATE.start_main_~i~1#1| 89)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9895#(< |ULTIMATE.start_main_~i~1#1| 90)} is VALID [2022-02-20 14:19:02,485 INFO L290 TraceCheckUtils]: 80: Hoare triple {9902#(< |ULTIMATE.start_main_~i~1#1| 89)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9902#(< |ULTIMATE.start_main_~i~1#1| 89)} is VALID [2022-02-20 14:19:02,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {9909#(< |ULTIMATE.start_main_~i~1#1| 88)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9902#(< |ULTIMATE.start_main_~i~1#1| 89)} is VALID [2022-02-20 14:19:02,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {9909#(< |ULTIMATE.start_main_~i~1#1| 88)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9909#(< |ULTIMATE.start_main_~i~1#1| 88)} is VALID [2022-02-20 14:19:02,486 INFO L290 TraceCheckUtils]: 77: Hoare triple {9916#(< |ULTIMATE.start_main_~i~1#1| 87)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9909#(< |ULTIMATE.start_main_~i~1#1| 88)} is VALID [2022-02-20 14:19:02,486 INFO L290 TraceCheckUtils]: 76: Hoare triple {9916#(< |ULTIMATE.start_main_~i~1#1| 87)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9916#(< |ULTIMATE.start_main_~i~1#1| 87)} is VALID [2022-02-20 14:19:02,486 INFO L290 TraceCheckUtils]: 75: Hoare triple {9923#(< |ULTIMATE.start_main_~i~1#1| 86)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9916#(< |ULTIMATE.start_main_~i~1#1| 87)} is VALID [2022-02-20 14:19:02,487 INFO L290 TraceCheckUtils]: 74: Hoare triple {9923#(< |ULTIMATE.start_main_~i~1#1| 86)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9923#(< |ULTIMATE.start_main_~i~1#1| 86)} is VALID [2022-02-20 14:19:02,487 INFO L290 TraceCheckUtils]: 73: Hoare triple {9930#(< |ULTIMATE.start_main_~i~1#1| 85)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9923#(< |ULTIMATE.start_main_~i~1#1| 86)} is VALID [2022-02-20 14:19:02,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {9930#(< |ULTIMATE.start_main_~i~1#1| 85)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9930#(< |ULTIMATE.start_main_~i~1#1| 85)} is VALID [2022-02-20 14:19:02,488 INFO L290 TraceCheckUtils]: 71: Hoare triple {9937#(< |ULTIMATE.start_main_~i~1#1| 84)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9930#(< |ULTIMATE.start_main_~i~1#1| 85)} is VALID [2022-02-20 14:19:02,488 INFO L290 TraceCheckUtils]: 70: Hoare triple {9937#(< |ULTIMATE.start_main_~i~1#1| 84)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9937#(< |ULTIMATE.start_main_~i~1#1| 84)} is VALID [2022-02-20 14:19:02,488 INFO L290 TraceCheckUtils]: 69: Hoare triple {9944#(< |ULTIMATE.start_main_~i~1#1| 83)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9937#(< |ULTIMATE.start_main_~i~1#1| 84)} is VALID [2022-02-20 14:19:02,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {9944#(< |ULTIMATE.start_main_~i~1#1| 83)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9944#(< |ULTIMATE.start_main_~i~1#1| 83)} is VALID [2022-02-20 14:19:02,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {9951#(< |ULTIMATE.start_main_~i~1#1| 82)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9944#(< |ULTIMATE.start_main_~i~1#1| 83)} is VALID [2022-02-20 14:19:02,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {9951#(< |ULTIMATE.start_main_~i~1#1| 82)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9951#(< |ULTIMATE.start_main_~i~1#1| 82)} is VALID [2022-02-20 14:19:02,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {9958#(< |ULTIMATE.start_main_~i~1#1| 81)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9951#(< |ULTIMATE.start_main_~i~1#1| 82)} is VALID [2022-02-20 14:19:02,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {9958#(< |ULTIMATE.start_main_~i~1#1| 81)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9958#(< |ULTIMATE.start_main_~i~1#1| 81)} is VALID [2022-02-20 14:19:02,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {9965#(< |ULTIMATE.start_main_~i~1#1| 80)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9958#(< |ULTIMATE.start_main_~i~1#1| 81)} is VALID [2022-02-20 14:19:02,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {9965#(< |ULTIMATE.start_main_~i~1#1| 80)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9965#(< |ULTIMATE.start_main_~i~1#1| 80)} is VALID [2022-02-20 14:19:02,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {9972#(< |ULTIMATE.start_main_~i~1#1| 79)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9965#(< |ULTIMATE.start_main_~i~1#1| 80)} is VALID [2022-02-20 14:19:02,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {9972#(< |ULTIMATE.start_main_~i~1#1| 79)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9972#(< |ULTIMATE.start_main_~i~1#1| 79)} is VALID [2022-02-20 14:19:02,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {9979#(< |ULTIMATE.start_main_~i~1#1| 78)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9972#(< |ULTIMATE.start_main_~i~1#1| 79)} is VALID [2022-02-20 14:19:02,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {9979#(< |ULTIMATE.start_main_~i~1#1| 78)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9979#(< |ULTIMATE.start_main_~i~1#1| 78)} is VALID [2022-02-20 14:19:02,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#(< |ULTIMATE.start_main_~i~1#1| 77)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9979#(< |ULTIMATE.start_main_~i~1#1| 78)} is VALID [2022-02-20 14:19:02,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#(< |ULTIMATE.start_main_~i~1#1| 77)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9986#(< |ULTIMATE.start_main_~i~1#1| 77)} is VALID [2022-02-20 14:19:02,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {9993#(< |ULTIMATE.start_main_~i~1#1| 76)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9986#(< |ULTIMATE.start_main_~i~1#1| 77)} is VALID [2022-02-20 14:19:02,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {9993#(< |ULTIMATE.start_main_~i~1#1| 76)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {9993#(< |ULTIMATE.start_main_~i~1#1| 76)} is VALID [2022-02-20 14:19:02,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {10000#(< |ULTIMATE.start_main_~i~1#1| 75)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {9993#(< |ULTIMATE.start_main_~i~1#1| 76)} is VALID [2022-02-20 14:19:02,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {10000#(< |ULTIMATE.start_main_~i~1#1| 75)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10000#(< |ULTIMATE.start_main_~i~1#1| 75)} is VALID [2022-02-20 14:19:02,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {10007#(< |ULTIMATE.start_main_~i~1#1| 74)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10000#(< |ULTIMATE.start_main_~i~1#1| 75)} is VALID [2022-02-20 14:19:02,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {10007#(< |ULTIMATE.start_main_~i~1#1| 74)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10007#(< |ULTIMATE.start_main_~i~1#1| 74)} is VALID [2022-02-20 14:19:02,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {10014#(< |ULTIMATE.start_main_~i~1#1| 73)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10007#(< |ULTIMATE.start_main_~i~1#1| 74)} is VALID [2022-02-20 14:19:02,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {10014#(< |ULTIMATE.start_main_~i~1#1| 73)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10014#(< |ULTIMATE.start_main_~i~1#1| 73)} is VALID [2022-02-20 14:19:02,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {10021#(< |ULTIMATE.start_main_~i~1#1| 72)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10014#(< |ULTIMATE.start_main_~i~1#1| 73)} is VALID [2022-02-20 14:19:02,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {10021#(< |ULTIMATE.start_main_~i~1#1| 72)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10021#(< |ULTIMATE.start_main_~i~1#1| 72)} is VALID [2022-02-20 14:19:02,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {10028#(< |ULTIMATE.start_main_~i~1#1| 71)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10021#(< |ULTIMATE.start_main_~i~1#1| 72)} is VALID [2022-02-20 14:19:02,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {10028#(< |ULTIMATE.start_main_~i~1#1| 71)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10028#(< |ULTIMATE.start_main_~i~1#1| 71)} is VALID [2022-02-20 14:19:02,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {10035#(< |ULTIMATE.start_main_~i~1#1| 70)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10028#(< |ULTIMATE.start_main_~i~1#1| 71)} is VALID [2022-02-20 14:19:02,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {10035#(< |ULTIMATE.start_main_~i~1#1| 70)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10035#(< |ULTIMATE.start_main_~i~1#1| 70)} is VALID [2022-02-20 14:19:02,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {10042#(< |ULTIMATE.start_main_~i~1#1| 69)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10035#(< |ULTIMATE.start_main_~i~1#1| 70)} is VALID [2022-02-20 14:19:02,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {10042#(< |ULTIMATE.start_main_~i~1#1| 69)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10042#(< |ULTIMATE.start_main_~i~1#1| 69)} is VALID [2022-02-20 14:19:02,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {10049#(< |ULTIMATE.start_main_~i~1#1| 68)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10042#(< |ULTIMATE.start_main_~i~1#1| 69)} is VALID [2022-02-20 14:19:02,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {10049#(< |ULTIMATE.start_main_~i~1#1| 68)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10049#(< |ULTIMATE.start_main_~i~1#1| 68)} is VALID [2022-02-20 14:19:02,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {10056#(< |ULTIMATE.start_main_~i~1#1| 67)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10049#(< |ULTIMATE.start_main_~i~1#1| 68)} is VALID [2022-02-20 14:19:02,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(< |ULTIMATE.start_main_~i~1#1| 67)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10056#(< |ULTIMATE.start_main_~i~1#1| 67)} is VALID [2022-02-20 14:19:02,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {10063#(< |ULTIMATE.start_main_~i~1#1| 66)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10056#(< |ULTIMATE.start_main_~i~1#1| 67)} is VALID [2022-02-20 14:19:02,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {10063#(< |ULTIMATE.start_main_~i~1#1| 66)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10063#(< |ULTIMATE.start_main_~i~1#1| 66)} is VALID [2022-02-20 14:19:02,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {10070#(< |ULTIMATE.start_main_~i~1#1| 65)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10063#(< |ULTIMATE.start_main_~i~1#1| 66)} is VALID [2022-02-20 14:19:02,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {10070#(< |ULTIMATE.start_main_~i~1#1| 65)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10070#(< |ULTIMATE.start_main_~i~1#1| 65)} is VALID [2022-02-20 14:19:02,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {10077#(< |ULTIMATE.start_main_~i~1#1| 64)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10070#(< |ULTIMATE.start_main_~i~1#1| 65)} is VALID [2022-02-20 14:19:02,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {10077#(< |ULTIMATE.start_main_~i~1#1| 64)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10077#(< |ULTIMATE.start_main_~i~1#1| 64)} is VALID [2022-02-20 14:19:02,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {10084#(< |ULTIMATE.start_main_~i~1#1| 63)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10077#(< |ULTIMATE.start_main_~i~1#1| 64)} is VALID [2022-02-20 14:19:02,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {10084#(< |ULTIMATE.start_main_~i~1#1| 63)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10084#(< |ULTIMATE.start_main_~i~1#1| 63)} is VALID [2022-02-20 14:19:02,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {10091#(< |ULTIMATE.start_main_~i~1#1| 62)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10084#(< |ULTIMATE.start_main_~i~1#1| 63)} is VALID [2022-02-20 14:19:02,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {10091#(< |ULTIMATE.start_main_~i~1#1| 62)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10091#(< |ULTIMATE.start_main_~i~1#1| 62)} is VALID [2022-02-20 14:19:02,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {10098#(< |ULTIMATE.start_main_~i~1#1| 61)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10091#(< |ULTIMATE.start_main_~i~1#1| 62)} is VALID [2022-02-20 14:19:02,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {10098#(< |ULTIMATE.start_main_~i~1#1| 61)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10098#(< |ULTIMATE.start_main_~i~1#1| 61)} is VALID [2022-02-20 14:19:02,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {10105#(< |ULTIMATE.start_main_~i~1#1| 60)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10098#(< |ULTIMATE.start_main_~i~1#1| 61)} is VALID [2022-02-20 14:19:02,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {10105#(< |ULTIMATE.start_main_~i~1#1| 60)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10105#(< |ULTIMATE.start_main_~i~1#1| 60)} is VALID [2022-02-20 14:19:02,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {10112#(< |ULTIMATE.start_main_~i~1#1| 59)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10105#(< |ULTIMATE.start_main_~i~1#1| 60)} is VALID [2022-02-20 14:19:02,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {10112#(< |ULTIMATE.start_main_~i~1#1| 59)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10112#(< |ULTIMATE.start_main_~i~1#1| 59)} is VALID [2022-02-20 14:19:02,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#(< |ULTIMATE.start_main_~i~1#1| 58)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10112#(< |ULTIMATE.start_main_~i~1#1| 59)} is VALID [2022-02-20 14:19:02,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#(< |ULTIMATE.start_main_~i~1#1| 58)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10119#(< |ULTIMATE.start_main_~i~1#1| 58)} is VALID [2022-02-20 14:19:02,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {10126#(< |ULTIMATE.start_main_~i~1#1| 57)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10119#(< |ULTIMATE.start_main_~i~1#1| 58)} is VALID [2022-02-20 14:19:02,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {10126#(< |ULTIMATE.start_main_~i~1#1| 57)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10126#(< |ULTIMATE.start_main_~i~1#1| 57)} is VALID [2022-02-20 14:19:02,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {10133#(< |ULTIMATE.start_main_~i~1#1| 56)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10126#(< |ULTIMATE.start_main_~i~1#1| 57)} is VALID [2022-02-20 14:19:02,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {10133#(< |ULTIMATE.start_main_~i~1#1| 56)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10133#(< |ULTIMATE.start_main_~i~1#1| 56)} is VALID [2022-02-20 14:19:02,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {10140#(< |ULTIMATE.start_main_~i~1#1| 55)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10133#(< |ULTIMATE.start_main_~i~1#1| 56)} is VALID [2022-02-20 14:19:02,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {10140#(< |ULTIMATE.start_main_~i~1#1| 55)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10140#(< |ULTIMATE.start_main_~i~1#1| 55)} is VALID [2022-02-20 14:19:02,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {10147#(< |ULTIMATE.start_main_~i~1#1| 54)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10140#(< |ULTIMATE.start_main_~i~1#1| 55)} is VALID [2022-02-20 14:19:02,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {10147#(< |ULTIMATE.start_main_~i~1#1| 54)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10147#(< |ULTIMATE.start_main_~i~1#1| 54)} is VALID [2022-02-20 14:19:02,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {10154#(< |ULTIMATE.start_main_~i~1#1| 53)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10147#(< |ULTIMATE.start_main_~i~1#1| 54)} is VALID [2022-02-20 14:19:02,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {10154#(< |ULTIMATE.start_main_~i~1#1| 53)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10154#(< |ULTIMATE.start_main_~i~1#1| 53)} is VALID [2022-02-20 14:19:02,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {10161#(< |ULTIMATE.start_main_~i~1#1| 52)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10154#(< |ULTIMATE.start_main_~i~1#1| 53)} is VALID [2022-02-20 14:19:02,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {10161#(< |ULTIMATE.start_main_~i~1#1| 52)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {10161#(< |ULTIMATE.start_main_~i~1#1| 52)} is VALID [2022-02-20 14:19:02,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {10161#(< |ULTIMATE.start_main_~i~1#1| 52)} is VALID [2022-02-20 14:19:02,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} is VALID [2022-02-20 14:19:02,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {8692#(<= |ULTIMATE.start_main_~i~1#1| 50)} is VALID [2022-02-20 14:19:02,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} is VALID [2022-02-20 14:19:02,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {8640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {8691#(<= |ULTIMATE.start_main_~i~1#1| 49)} is VALID [2022-02-20 14:19:02,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {8640#true} is VALID [2022-02-20 14:19:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2022-02-20 14:19:02,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640071431] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:19:02,513 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:19:02,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 103 [2022-02-20 14:19:02,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327794352] [2022-02-20 14:19:02,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:19:02,515 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 224 [2022-02-20 14:19:02,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:02,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:19:02,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:02,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-02-20 14:19:02,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-02-20 14:19:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-02-20 14:19:02,694 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:19:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:03,134 INFO L93 Difference]: Finished difference Result 315 states and 372 transitions. [2022-02-20 14:19:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-20 14:19:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 224 [2022-02-20 14:19:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:19:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 296 transitions. [2022-02-20 14:19:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:19:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 296 transitions. [2022-02-20 14:19:03,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states and 296 transitions. [2022-02-20 14:19:03,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:03,361 INFO L225 Difference]: With dead ends: 315 [2022-02-20 14:19:03,361 INFO L226 Difference]: Without dead ends: 259 [2022-02-20 14:19:03,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-02-20 14:19:03,365 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 100 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:03,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 46 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:19:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-20 14:19:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-02-20 14:19:03,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:03,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 259 states, 254 states have (on average 1.0118110236220472) internal successors, (257), 254 states have internal predecessors, (257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:03,445 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 259 states, 254 states have (on average 1.0118110236220472) internal successors, (257), 254 states have internal predecessors, (257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:03,445 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 259 states, 254 states have (on average 1.0118110236220472) internal successors, (257), 254 states have internal predecessors, (257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:03,451 INFO L93 Difference]: Finished difference Result 259 states and 263 transitions. [2022-02-20 14:19:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 263 transitions. [2022-02-20 14:19:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:03,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 254 states have (on average 1.0118110236220472) internal successors, (257), 254 states have internal predecessors, (257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 259 states. [2022-02-20 14:19:03,452 INFO L87 Difference]: Start difference. First operand has 259 states, 254 states have (on average 1.0118110236220472) internal successors, (257), 254 states have internal predecessors, (257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 259 states. [2022-02-20 14:19:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:03,457 INFO L93 Difference]: Finished difference Result 259 states and 263 transitions. [2022-02-20 14:19:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 263 transitions. [2022-02-20 14:19:03,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:03,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:03,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:03,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 254 states have (on average 1.0118110236220472) internal successors, (257), 254 states have internal predecessors, (257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 263 transitions. [2022-02-20 14:19:03,465 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 263 transitions. Word has length 224 [2022-02-20 14:19:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:03,465 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 263 transitions. [2022-02-20 14:19:03,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.203883495145631) internal successors, (227), 103 states have internal predecessors, (227), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 14:19:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 263 transitions. [2022-02-20 14:19:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-02-20 14:19:03,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:03,469 INFO L514 BasicCegarLoop]: trace histogram [100, 100, 42, 42, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:03,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 14:19:03,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 14:19:03,683 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 132529115, now seen corresponding path program 9 times [2022-02-20 14:19:03,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:03,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609333203] [2022-02-20 14:19:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-02-20 14:19:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:04,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11655#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:04,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {11655#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11655#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:04,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {11655#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11656#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:04,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {11656#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11656#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:04,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {11656#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11657#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:04,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {11657#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11657#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:04,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {11657#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11658#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:04,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {11658#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11658#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:04,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {11658#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11659#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:04,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {11659#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11659#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:04,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {11659#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11660#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:04,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {11660#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11660#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:04,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {11660#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11661#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:04,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {11661#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11661#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:04,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {11661#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11662#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:04,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {11662#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11662#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:04,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {11662#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11663#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:04,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {11663#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11663#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:04,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {11663#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11664#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:04,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {11664#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11664#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:04,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {11664#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11665#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:04,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {11665#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11665#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:04,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {11665#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11666#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:04,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {11666#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11666#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:04,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {11666#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11667#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:04,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {11667#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11667#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:04,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {11667#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11668#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:04,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {11668#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11668#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:04,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {11668#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11669#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:04,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {11669#(<= xor_~i~0 15)} assume !(~i~0 < 100); {11555#false} is VALID [2022-02-20 14:19:04,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {11555#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11555#false} is VALID [2022-02-20 14:19:04,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {11555#false} assume true; {11555#false} is VALID [2022-02-20 14:19:04,279 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11555#false} {11554#true} #65#return; {11555#false} is VALID [2022-02-20 14:19:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-02-20 14:19:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:04,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:04,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:04,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:04,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:04,305 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11554#true} {11555#false} #67#return; {11555#false} is VALID [2022-02-20 14:19:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-02-20 14:19:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:04,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:04,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:04,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:04,330 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11554#true} {11555#false} #69#return; {11555#false} is VALID [2022-02-20 14:19:04,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {11554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {11554#true} is VALID [2022-02-20 14:19:04,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {11554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {11554#true} is VALID [2022-02-20 14:19:04,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 68: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 69: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 74: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 85: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 86: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 87: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 88: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,343 INFO L290 TraceCheckUtils]: 91: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 92: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 93: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 94: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 95: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 96: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 97: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,344 INFO L290 TraceCheckUtils]: 98: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 99: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 102: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 103: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 104: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,345 INFO L290 TraceCheckUtils]: 105: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 106: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 107: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 108: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 109: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 110: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 111: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,346 INFO L290 TraceCheckUtils]: 112: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 113: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 114: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 115: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 116: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 117: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 118: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,347 INFO L290 TraceCheckUtils]: 119: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 120: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 121: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 122: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 123: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 124: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 125: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,348 INFO L290 TraceCheckUtils]: 126: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 127: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 128: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 129: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 130: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 131: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 132: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,349 INFO L290 TraceCheckUtils]: 133: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 134: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 135: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 136: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 137: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 138: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 139: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,350 INFO L290 TraceCheckUtils]: 140: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 141: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 142: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 143: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 144: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 145: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 146: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,351 INFO L290 TraceCheckUtils]: 147: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 148: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 149: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 150: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 151: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 152: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 153: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,352 INFO L290 TraceCheckUtils]: 154: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 155: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 156: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 157: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 158: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 159: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 160: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,353 INFO L290 TraceCheckUtils]: 161: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 162: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 163: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 164: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 165: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 166: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 167: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,354 INFO L290 TraceCheckUtils]: 168: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 169: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 170: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 171: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 172: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 173: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 174: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,355 INFO L290 TraceCheckUtils]: 175: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 176: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 177: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 178: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 179: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 180: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 181: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 182: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,356 INFO L290 TraceCheckUtils]: 183: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 184: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 185: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 186: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 187: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 188: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 189: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,357 INFO L290 TraceCheckUtils]: 190: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 191: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 192: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 193: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 194: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 195: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 196: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,358 INFO L290 TraceCheckUtils]: 197: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,359 INFO L290 TraceCheckUtils]: 198: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,359 INFO L290 TraceCheckUtils]: 199: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,359 INFO L290 TraceCheckUtils]: 200: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:04,359 INFO L290 TraceCheckUtils]: 201: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:04,359 INFO L290 TraceCheckUtils]: 202: Hoare triple {11554#true} assume !(main_~i~1#1 < 100); {11554#true} is VALID [2022-02-20 14:19:04,359 INFO L272 TraceCheckUtils]: 203: Hoare triple {11554#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:04,360 INFO L290 TraceCheckUtils]: 204: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11655#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:04,360 INFO L290 TraceCheckUtils]: 205: Hoare triple {11655#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11655#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:04,361 INFO L290 TraceCheckUtils]: 206: Hoare triple {11655#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11656#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:04,361 INFO L290 TraceCheckUtils]: 207: Hoare triple {11656#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11656#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:04,362 INFO L290 TraceCheckUtils]: 208: Hoare triple {11656#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11657#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:04,362 INFO L290 TraceCheckUtils]: 209: Hoare triple {11657#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11657#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:04,362 INFO L290 TraceCheckUtils]: 210: Hoare triple {11657#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11658#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:04,363 INFO L290 TraceCheckUtils]: 211: Hoare triple {11658#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11658#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:04,363 INFO L290 TraceCheckUtils]: 212: Hoare triple {11658#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11659#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:04,363 INFO L290 TraceCheckUtils]: 213: Hoare triple {11659#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11659#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:04,364 INFO L290 TraceCheckUtils]: 214: Hoare triple {11659#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11660#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:04,364 INFO L290 TraceCheckUtils]: 215: Hoare triple {11660#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11660#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:04,365 INFO L290 TraceCheckUtils]: 216: Hoare triple {11660#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11661#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:04,365 INFO L290 TraceCheckUtils]: 217: Hoare triple {11661#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11661#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:04,366 INFO L290 TraceCheckUtils]: 218: Hoare triple {11661#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11662#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:04,366 INFO L290 TraceCheckUtils]: 219: Hoare triple {11662#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11662#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:04,366 INFO L290 TraceCheckUtils]: 220: Hoare triple {11662#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11663#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:04,367 INFO L290 TraceCheckUtils]: 221: Hoare triple {11663#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11663#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:04,367 INFO L290 TraceCheckUtils]: 222: Hoare triple {11663#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11664#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:04,368 INFO L290 TraceCheckUtils]: 223: Hoare triple {11664#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11664#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:04,368 INFO L290 TraceCheckUtils]: 224: Hoare triple {11664#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11665#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:04,369 INFO L290 TraceCheckUtils]: 225: Hoare triple {11665#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11665#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:04,369 INFO L290 TraceCheckUtils]: 226: Hoare triple {11665#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11666#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:04,369 INFO L290 TraceCheckUtils]: 227: Hoare triple {11666#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11666#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:04,370 INFO L290 TraceCheckUtils]: 228: Hoare triple {11666#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11667#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:04,370 INFO L290 TraceCheckUtils]: 229: Hoare triple {11667#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11667#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:04,371 INFO L290 TraceCheckUtils]: 230: Hoare triple {11667#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11668#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:04,371 INFO L290 TraceCheckUtils]: 231: Hoare triple {11668#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11668#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:04,371 INFO L290 TraceCheckUtils]: 232: Hoare triple {11668#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11669#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:04,372 INFO L290 TraceCheckUtils]: 233: Hoare triple {11669#(<= xor_~i~0 15)} assume !(~i~0 < 100); {11555#false} is VALID [2022-02-20 14:19:04,372 INFO L290 TraceCheckUtils]: 234: Hoare triple {11555#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11555#false} is VALID [2022-02-20 14:19:04,372 INFO L290 TraceCheckUtils]: 235: Hoare triple {11555#false} assume true; {11555#false} is VALID [2022-02-20 14:19:04,372 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {11555#false} {11554#true} #65#return; {11555#false} is VALID [2022-02-20 14:19:04,372 INFO L290 TraceCheckUtils]: 237: Hoare triple {11555#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {11555#false} is VALID [2022-02-20 14:19:04,373 INFO L272 TraceCheckUtils]: 238: Hoare triple {11555#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:04,373 INFO L290 TraceCheckUtils]: 239: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:04,373 INFO L290 TraceCheckUtils]: 240: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,373 INFO L290 TraceCheckUtils]: 241: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,373 INFO L290 TraceCheckUtils]: 242: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,373 INFO L290 TraceCheckUtils]: 243: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,373 INFO L290 TraceCheckUtils]: 244: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 245: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 246: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 247: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 248: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 249: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 250: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,374 INFO L290 TraceCheckUtils]: 251: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 252: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 253: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 254: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 255: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 256: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 257: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,375 INFO L290 TraceCheckUtils]: 258: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 259: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 260: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 261: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 262: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 263: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 264: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,376 INFO L290 TraceCheckUtils]: 265: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,377 INFO L290 TraceCheckUtils]: 266: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,377 INFO L290 TraceCheckUtils]: 267: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,377 INFO L290 TraceCheckUtils]: 268: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:04,384 INFO L290 TraceCheckUtils]: 269: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:04,385 INFO L290 TraceCheckUtils]: 270: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:04,385 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {11554#true} {11555#false} #67#return; {11555#false} is VALID [2022-02-20 14:19:04,385 INFO L290 TraceCheckUtils]: 272: Hoare triple {11555#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {11555#false} is VALID [2022-02-20 14:19:04,385 INFO L290 TraceCheckUtils]: 273: Hoare triple {11555#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {11555#false} is VALID [2022-02-20 14:19:04,385 INFO L290 TraceCheckUtils]: 274: Hoare triple {11555#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {11555#false} is VALID [2022-02-20 14:19:04,385 INFO L290 TraceCheckUtils]: 275: Hoare triple {11555#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 276: Hoare triple {11555#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 277: Hoare triple {11555#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 278: Hoare triple {11555#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 279: Hoare triple {11555#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 280: Hoare triple {11555#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 281: Hoare triple {11555#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {11555#false} is VALID [2022-02-20 14:19:04,386 INFO L290 TraceCheckUtils]: 282: Hoare triple {11555#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {11555#false} is VALID [2022-02-20 14:19:04,387 INFO L290 TraceCheckUtils]: 283: Hoare triple {11555#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {11555#false} is VALID [2022-02-20 14:19:04,387 INFO L290 TraceCheckUtils]: 284: Hoare triple {11555#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {11555#false} is VALID [2022-02-20 14:19:04,387 INFO L290 TraceCheckUtils]: 285: Hoare triple {11555#false} assume !(main_~i~2#1 < 99); {11555#false} is VALID [2022-02-20 14:19:04,387 INFO L290 TraceCheckUtils]: 286: Hoare triple {11555#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {11555#false} is VALID [2022-02-20 14:19:04,387 INFO L272 TraceCheckUtils]: 287: Hoare triple {11555#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:04,387 INFO L290 TraceCheckUtils]: 288: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:04,387 INFO L290 TraceCheckUtils]: 289: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 290: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 291: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 292: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 293: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 294: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 295: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,388 INFO L290 TraceCheckUtils]: 296: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 297: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 298: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 299: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 300: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 301: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 302: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,389 INFO L290 TraceCheckUtils]: 303: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 304: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 305: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 306: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 307: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 308: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 309: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,390 INFO L290 TraceCheckUtils]: 310: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 311: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 312: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 313: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 314: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 315: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 316: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:04,391 INFO L290 TraceCheckUtils]: 317: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:04,392 INFO L290 TraceCheckUtils]: 318: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:04,392 INFO L290 TraceCheckUtils]: 319: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:04,392 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {11554#true} {11555#false} #69#return; {11555#false} is VALID [2022-02-20 14:19:04,392 INFO L290 TraceCheckUtils]: 321: Hoare triple {11555#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {11555#false} is VALID [2022-02-20 14:19:04,392 INFO L290 TraceCheckUtils]: 322: Hoare triple {11555#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {11555#false} is VALID [2022-02-20 14:19:04,392 INFO L290 TraceCheckUtils]: 323: Hoare triple {11555#false} assume !false; {11555#false} is VALID [2022-02-20 14:19:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11899 backedges. 0 proven. 1044 refuted. 0 times theorem prover too weak. 10855 trivial. 0 not checked. [2022-02-20 14:19:04,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:04,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609333203] [2022-02-20 14:19:04,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609333203] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:19:04,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930899144] [2022-02-20 14:19:04,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:19:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:19:04,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:19:04,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 14:19:04,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-20 14:19:04,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:19:04,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:19:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:04,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:19:05,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {11554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {11554#true} is VALID [2022-02-20 14:19:05,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {11554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {11554#true} is VALID [2022-02-20 14:19:05,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 70: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 71: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 78: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 79: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 80: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 81: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 82: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 87: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,600 INFO L290 TraceCheckUtils]: 92: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 99: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 100: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 101: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 102: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 103: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 104: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 105: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 106: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,601 INFO L290 TraceCheckUtils]: 107: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 110: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 111: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 112: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,602 INFO L290 TraceCheckUtils]: 115: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 116: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 117: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 118: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 119: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 120: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 121: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 122: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 123: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 124: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 125: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 126: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 127: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 128: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,603 INFO L290 TraceCheckUtils]: 129: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 130: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 131: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 132: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 133: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 134: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 135: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 136: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 137: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 138: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 139: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 140: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 141: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 142: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 143: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,604 INFO L290 TraceCheckUtils]: 144: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 145: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 146: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 147: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 148: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 149: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 150: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 151: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 152: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 153: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 154: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 155: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,605 INFO L290 TraceCheckUtils]: 156: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 157: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 158: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 159: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 160: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 161: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 162: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,606 INFO L290 TraceCheckUtils]: 163: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 164: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 165: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 166: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 167: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 168: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 169: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,607 INFO L290 TraceCheckUtils]: 170: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 171: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 172: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 173: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 174: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 175: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 176: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,608 INFO L290 TraceCheckUtils]: 177: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,609 INFO L290 TraceCheckUtils]: 178: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,609 INFO L290 TraceCheckUtils]: 179: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,609 INFO L290 TraceCheckUtils]: 180: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,609 INFO L290 TraceCheckUtils]: 181: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,609 INFO L290 TraceCheckUtils]: 182: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,609 INFO L290 TraceCheckUtils]: 183: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 184: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 185: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 186: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 187: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 188: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 189: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,610 INFO L290 TraceCheckUtils]: 190: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 191: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 192: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 193: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 194: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 195: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 196: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,611 INFO L290 TraceCheckUtils]: 197: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L290 TraceCheckUtils]: 198: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L290 TraceCheckUtils]: 199: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L290 TraceCheckUtils]: 200: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L290 TraceCheckUtils]: 201: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L290 TraceCheckUtils]: 202: Hoare triple {11554#true} assume !(main_~i~1#1 < 100); {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L272 TraceCheckUtils]: 203: Hoare triple {11554#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:05,612 INFO L290 TraceCheckUtils]: 204: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 205: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 206: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 207: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 208: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 209: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 210: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 211: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 212: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 213: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 214: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,613 INFO L290 TraceCheckUtils]: 215: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 216: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 217: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 218: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 219: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 220: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 221: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 222: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 223: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 224: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 225: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 226: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 227: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 228: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 229: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,614 INFO L290 TraceCheckUtils]: 230: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 231: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 232: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 233: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 234: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 235: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {11554#true} {11554#true} #65#return; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 237: Hoare triple {11554#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L272 TraceCheckUtils]: 238: Hoare triple {11554#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 239: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 240: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 241: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 242: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 243: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,615 INFO L290 TraceCheckUtils]: 244: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 245: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 246: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 247: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 248: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 249: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 250: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 251: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 252: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 253: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 254: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 255: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 256: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 257: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 258: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,616 INFO L290 TraceCheckUtils]: 259: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 260: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 261: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 262: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 263: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 264: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 265: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 266: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 267: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 268: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 269: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L290 TraceCheckUtils]: 270: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:05,617 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {11554#true} {11554#true} #67#return; {11554#true} is VALID [2022-02-20 14:19:05,618 INFO L290 TraceCheckUtils]: 272: Hoare triple {11554#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {12489#(<= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:19:05,618 INFO L290 TraceCheckUtils]: 273: Hoare triple {12489#(<= |ULTIMATE.start_main_~i~2#1| 0)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12489#(<= |ULTIMATE.start_main_~i~2#1| 0)} is VALID [2022-02-20 14:19:05,619 INFO L290 TraceCheckUtils]: 274: Hoare triple {12489#(<= |ULTIMATE.start_main_~i~2#1| 0)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12496#(<= |ULTIMATE.start_main_~i~2#1| 1)} is VALID [2022-02-20 14:19:05,619 INFO L290 TraceCheckUtils]: 275: Hoare triple {12496#(<= |ULTIMATE.start_main_~i~2#1| 1)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12496#(<= |ULTIMATE.start_main_~i~2#1| 1)} is VALID [2022-02-20 14:19:05,619 INFO L290 TraceCheckUtils]: 276: Hoare triple {12496#(<= |ULTIMATE.start_main_~i~2#1| 1)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12503#(<= |ULTIMATE.start_main_~i~2#1| 2)} is VALID [2022-02-20 14:19:05,620 INFO L290 TraceCheckUtils]: 277: Hoare triple {12503#(<= |ULTIMATE.start_main_~i~2#1| 2)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12503#(<= |ULTIMATE.start_main_~i~2#1| 2)} is VALID [2022-02-20 14:19:05,620 INFO L290 TraceCheckUtils]: 278: Hoare triple {12503#(<= |ULTIMATE.start_main_~i~2#1| 2)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12510#(<= |ULTIMATE.start_main_~i~2#1| 3)} is VALID [2022-02-20 14:19:05,620 INFO L290 TraceCheckUtils]: 279: Hoare triple {12510#(<= |ULTIMATE.start_main_~i~2#1| 3)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12510#(<= |ULTIMATE.start_main_~i~2#1| 3)} is VALID [2022-02-20 14:19:05,621 INFO L290 TraceCheckUtils]: 280: Hoare triple {12510#(<= |ULTIMATE.start_main_~i~2#1| 3)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12517#(<= |ULTIMATE.start_main_~i~2#1| 4)} is VALID [2022-02-20 14:19:05,621 INFO L290 TraceCheckUtils]: 281: Hoare triple {12517#(<= |ULTIMATE.start_main_~i~2#1| 4)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12517#(<= |ULTIMATE.start_main_~i~2#1| 4)} is VALID [2022-02-20 14:19:05,622 INFO L290 TraceCheckUtils]: 282: Hoare triple {12517#(<= |ULTIMATE.start_main_~i~2#1| 4)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12524#(<= |ULTIMATE.start_main_~i~2#1| 5)} is VALID [2022-02-20 14:19:05,622 INFO L290 TraceCheckUtils]: 283: Hoare triple {12524#(<= |ULTIMATE.start_main_~i~2#1| 5)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12524#(<= |ULTIMATE.start_main_~i~2#1| 5)} is VALID [2022-02-20 14:19:05,622 INFO L290 TraceCheckUtils]: 284: Hoare triple {12524#(<= |ULTIMATE.start_main_~i~2#1| 5)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12531#(<= |ULTIMATE.start_main_~i~2#1| 6)} is VALID [2022-02-20 14:19:05,623 INFO L290 TraceCheckUtils]: 285: Hoare triple {12531#(<= |ULTIMATE.start_main_~i~2#1| 6)} assume !(main_~i~2#1 < 99); {11555#false} is VALID [2022-02-20 14:19:05,623 INFO L290 TraceCheckUtils]: 286: Hoare triple {11555#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {11555#false} is VALID [2022-02-20 14:19:05,623 INFO L272 TraceCheckUtils]: 287: Hoare triple {11555#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11555#false} is VALID [2022-02-20 14:19:05,623 INFO L290 TraceCheckUtils]: 288: Hoare triple {11555#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11555#false} is VALID [2022-02-20 14:19:05,623 INFO L290 TraceCheckUtils]: 289: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,623 INFO L290 TraceCheckUtils]: 290: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,624 INFO L290 TraceCheckUtils]: 291: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,624 INFO L290 TraceCheckUtils]: 292: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,624 INFO L290 TraceCheckUtils]: 293: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,624 INFO L290 TraceCheckUtils]: 294: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,624 INFO L290 TraceCheckUtils]: 295: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,624 INFO L290 TraceCheckUtils]: 296: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 297: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 298: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 299: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 300: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 301: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 302: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,625 INFO L290 TraceCheckUtils]: 303: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 304: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 305: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 306: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 307: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 308: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 309: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,626 INFO L290 TraceCheckUtils]: 310: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 311: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 312: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 313: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 314: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 315: Hoare triple {11555#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 316: Hoare triple {11555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11555#false} is VALID [2022-02-20 14:19:05,627 INFO L290 TraceCheckUtils]: 317: Hoare triple {11555#false} assume !(~i~0 < 100); {11555#false} is VALID [2022-02-20 14:19:05,628 INFO L290 TraceCheckUtils]: 318: Hoare triple {11555#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11555#false} is VALID [2022-02-20 14:19:05,628 INFO L290 TraceCheckUtils]: 319: Hoare triple {11555#false} assume true; {11555#false} is VALID [2022-02-20 14:19:05,628 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {11555#false} {11555#false} #69#return; {11555#false} is VALID [2022-02-20 14:19:05,628 INFO L290 TraceCheckUtils]: 321: Hoare triple {11555#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {11555#false} is VALID [2022-02-20 14:19:05,628 INFO L290 TraceCheckUtils]: 322: Hoare triple {11555#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {11555#false} is VALID [2022-02-20 14:19:05,628 INFO L290 TraceCheckUtils]: 323: Hoare triple {11555#false} assume !false; {11555#false} is VALID [2022-02-20 14:19:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11899 backedges. 850 proven. 36 refuted. 0 times theorem prover too weak. 11013 trivial. 0 not checked. [2022-02-20 14:19:05,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 323: Hoare triple {11555#false} assume !false; {11555#false} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 322: Hoare triple {11555#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {11555#false} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 321: Hoare triple {11555#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {11555#false} is VALID [2022-02-20 14:19:06,217 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {11554#true} {11555#false} #69#return; {11555#false} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 319: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 318: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 317: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 316: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 315: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,217 INFO L290 TraceCheckUtils]: 314: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 313: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 312: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 311: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 310: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 309: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 308: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 307: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 306: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 305: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 304: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 303: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,218 INFO L290 TraceCheckUtils]: 302: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,219 INFO L290 TraceCheckUtils]: 301: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,219 INFO L290 TraceCheckUtils]: 300: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,219 INFO L290 TraceCheckUtils]: 299: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,219 INFO L290 TraceCheckUtils]: 298: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,230 INFO L290 TraceCheckUtils]: 297: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,230 INFO L290 TraceCheckUtils]: 296: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,230 INFO L290 TraceCheckUtils]: 295: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,230 INFO L290 TraceCheckUtils]: 294: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,230 INFO L290 TraceCheckUtils]: 293: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,230 INFO L290 TraceCheckUtils]: 292: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,231 INFO L290 TraceCheckUtils]: 291: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,231 INFO L290 TraceCheckUtils]: 290: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,231 INFO L290 TraceCheckUtils]: 289: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,231 INFO L290 TraceCheckUtils]: 288: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:06,231 INFO L272 TraceCheckUtils]: 287: Hoare triple {11555#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:06,231 INFO L290 TraceCheckUtils]: 286: Hoare triple {11555#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {11555#false} is VALID [2022-02-20 14:19:06,232 INFO L290 TraceCheckUtils]: 285: Hoare triple {12763#(< |ULTIMATE.start_main_~i~2#1| 99)} assume !(main_~i~2#1 < 99); {11555#false} is VALID [2022-02-20 14:19:06,232 INFO L290 TraceCheckUtils]: 284: Hoare triple {12767#(< |ULTIMATE.start_main_~i~2#1| 98)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12763#(< |ULTIMATE.start_main_~i~2#1| 99)} is VALID [2022-02-20 14:19:06,233 INFO L290 TraceCheckUtils]: 283: Hoare triple {12767#(< |ULTIMATE.start_main_~i~2#1| 98)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12767#(< |ULTIMATE.start_main_~i~2#1| 98)} is VALID [2022-02-20 14:19:06,233 INFO L290 TraceCheckUtils]: 282: Hoare triple {12774#(< |ULTIMATE.start_main_~i~2#1| 97)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12767#(< |ULTIMATE.start_main_~i~2#1| 98)} is VALID [2022-02-20 14:19:06,233 INFO L290 TraceCheckUtils]: 281: Hoare triple {12774#(< |ULTIMATE.start_main_~i~2#1| 97)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12774#(< |ULTIMATE.start_main_~i~2#1| 97)} is VALID [2022-02-20 14:19:06,234 INFO L290 TraceCheckUtils]: 280: Hoare triple {12781#(< |ULTIMATE.start_main_~i~2#1| 96)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12774#(< |ULTIMATE.start_main_~i~2#1| 97)} is VALID [2022-02-20 14:19:06,234 INFO L290 TraceCheckUtils]: 279: Hoare triple {12781#(< |ULTIMATE.start_main_~i~2#1| 96)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12781#(< |ULTIMATE.start_main_~i~2#1| 96)} is VALID [2022-02-20 14:19:06,235 INFO L290 TraceCheckUtils]: 278: Hoare triple {12788#(< |ULTIMATE.start_main_~i~2#1| 95)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12781#(< |ULTIMATE.start_main_~i~2#1| 96)} is VALID [2022-02-20 14:19:06,235 INFO L290 TraceCheckUtils]: 277: Hoare triple {12788#(< |ULTIMATE.start_main_~i~2#1| 95)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12788#(< |ULTIMATE.start_main_~i~2#1| 95)} is VALID [2022-02-20 14:19:06,235 INFO L290 TraceCheckUtils]: 276: Hoare triple {12795#(< |ULTIMATE.start_main_~i~2#1| 94)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12788#(< |ULTIMATE.start_main_~i~2#1| 95)} is VALID [2022-02-20 14:19:06,236 INFO L290 TraceCheckUtils]: 275: Hoare triple {12795#(< |ULTIMATE.start_main_~i~2#1| 94)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12795#(< |ULTIMATE.start_main_~i~2#1| 94)} is VALID [2022-02-20 14:19:06,236 INFO L290 TraceCheckUtils]: 274: Hoare triple {12802#(< |ULTIMATE.start_main_~i~2#1| 93)} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {12795#(< |ULTIMATE.start_main_~i~2#1| 94)} is VALID [2022-02-20 14:19:06,236 INFO L290 TraceCheckUtils]: 273: Hoare triple {12802#(< |ULTIMATE.start_main_~i~2#1| 93)} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {12802#(< |ULTIMATE.start_main_~i~2#1| 93)} is VALID [2022-02-20 14:19:06,237 INFO L290 TraceCheckUtils]: 272: Hoare triple {11554#true} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {12802#(< |ULTIMATE.start_main_~i~2#1| 93)} is VALID [2022-02-20 14:19:06,237 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {11554#true} {11554#true} #67#return; {11554#true} is VALID [2022-02-20 14:19:06,237 INFO L290 TraceCheckUtils]: 270: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:06,237 INFO L290 TraceCheckUtils]: 269: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 268: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 267: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 266: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 265: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 264: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 263: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 262: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,238 INFO L290 TraceCheckUtils]: 261: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 260: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 259: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 258: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 257: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 256: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 255: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 254: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 253: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 252: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 251: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,239 INFO L290 TraceCheckUtils]: 250: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 249: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 248: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 247: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 246: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 245: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 244: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 243: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 242: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 241: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 240: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,240 INFO L290 TraceCheckUtils]: 239: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:06,241 INFO L272 TraceCheckUtils]: 238: Hoare triple {11554#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:06,241 INFO L290 TraceCheckUtils]: 237: Hoare triple {11554#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {11554#true} is VALID [2022-02-20 14:19:06,241 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {11554#true} {11554#true} #65#return; {11554#true} is VALID [2022-02-20 14:19:06,241 INFO L290 TraceCheckUtils]: 235: Hoare triple {11554#true} assume true; {11554#true} is VALID [2022-02-20 14:19:06,241 INFO L290 TraceCheckUtils]: 234: Hoare triple {11554#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11554#true} is VALID [2022-02-20 14:19:06,242 INFO L290 TraceCheckUtils]: 233: Hoare triple {11554#true} assume !(~i~0 < 100); {11554#true} is VALID [2022-02-20 14:19:06,242 INFO L290 TraceCheckUtils]: 232: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,242 INFO L290 TraceCheckUtils]: 231: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,242 INFO L290 TraceCheckUtils]: 230: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,242 INFO L290 TraceCheckUtils]: 229: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,242 INFO L290 TraceCheckUtils]: 228: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,243 INFO L290 TraceCheckUtils]: 227: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,243 INFO L290 TraceCheckUtils]: 226: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,243 INFO L290 TraceCheckUtils]: 225: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,243 INFO L290 TraceCheckUtils]: 224: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,243 INFO L290 TraceCheckUtils]: 223: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,243 INFO L290 TraceCheckUtils]: 222: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,244 INFO L290 TraceCheckUtils]: 221: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,244 INFO L290 TraceCheckUtils]: 220: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,244 INFO L290 TraceCheckUtils]: 219: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,244 INFO L290 TraceCheckUtils]: 218: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,244 INFO L290 TraceCheckUtils]: 217: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,244 INFO L290 TraceCheckUtils]: 216: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,245 INFO L290 TraceCheckUtils]: 215: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,245 INFO L290 TraceCheckUtils]: 214: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,245 INFO L290 TraceCheckUtils]: 213: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,245 INFO L290 TraceCheckUtils]: 212: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,245 INFO L290 TraceCheckUtils]: 211: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,245 INFO L290 TraceCheckUtils]: 210: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,246 INFO L290 TraceCheckUtils]: 209: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,246 INFO L290 TraceCheckUtils]: 208: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,246 INFO L290 TraceCheckUtils]: 207: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,246 INFO L290 TraceCheckUtils]: 206: Hoare triple {11554#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11554#true} is VALID [2022-02-20 14:19:06,246 INFO L290 TraceCheckUtils]: 205: Hoare triple {11554#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {11554#true} is VALID [2022-02-20 14:19:06,246 INFO L290 TraceCheckUtils]: 204: Hoare triple {11554#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {11554#true} is VALID [2022-02-20 14:19:06,247 INFO L272 TraceCheckUtils]: 203: Hoare triple {11554#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {11554#true} is VALID [2022-02-20 14:19:06,247 INFO L290 TraceCheckUtils]: 202: Hoare triple {11554#true} assume !(main_~i~1#1 < 100); {11554#true} is VALID [2022-02-20 14:19:06,247 INFO L290 TraceCheckUtils]: 201: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,247 INFO L290 TraceCheckUtils]: 200: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,247 INFO L290 TraceCheckUtils]: 199: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,247 INFO L290 TraceCheckUtils]: 198: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,248 INFO L290 TraceCheckUtils]: 197: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,248 INFO L290 TraceCheckUtils]: 196: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,248 INFO L290 TraceCheckUtils]: 195: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,248 INFO L290 TraceCheckUtils]: 194: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,248 INFO L290 TraceCheckUtils]: 193: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,248 INFO L290 TraceCheckUtils]: 192: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,249 INFO L290 TraceCheckUtils]: 191: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,249 INFO L290 TraceCheckUtils]: 190: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,249 INFO L290 TraceCheckUtils]: 189: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,249 INFO L290 TraceCheckUtils]: 188: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,249 INFO L290 TraceCheckUtils]: 187: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,249 INFO L290 TraceCheckUtils]: 186: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 185: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 184: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 183: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 182: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 181: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 180: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 179: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 178: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,250 INFO L290 TraceCheckUtils]: 177: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,251 INFO L290 TraceCheckUtils]: 176: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,251 INFO L290 TraceCheckUtils]: 175: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,251 INFO L290 TraceCheckUtils]: 174: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,251 INFO L290 TraceCheckUtils]: 173: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,251 INFO L290 TraceCheckUtils]: 172: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,251 INFO L290 TraceCheckUtils]: 171: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,252 INFO L290 TraceCheckUtils]: 170: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,252 INFO L290 TraceCheckUtils]: 169: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,252 INFO L290 TraceCheckUtils]: 168: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,252 INFO L290 TraceCheckUtils]: 167: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,252 INFO L290 TraceCheckUtils]: 166: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,253 INFO L290 TraceCheckUtils]: 165: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,253 INFO L290 TraceCheckUtils]: 164: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,253 INFO L290 TraceCheckUtils]: 163: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,253 INFO L290 TraceCheckUtils]: 162: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,253 INFO L290 TraceCheckUtils]: 161: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,253 INFO L290 TraceCheckUtils]: 160: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,254 INFO L290 TraceCheckUtils]: 159: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,254 INFO L290 TraceCheckUtils]: 158: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,254 INFO L290 TraceCheckUtils]: 157: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,254 INFO L290 TraceCheckUtils]: 156: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,254 INFO L290 TraceCheckUtils]: 155: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,254 INFO L290 TraceCheckUtils]: 154: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,255 INFO L290 TraceCheckUtils]: 153: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,255 INFO L290 TraceCheckUtils]: 152: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,255 INFO L290 TraceCheckUtils]: 151: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,255 INFO L290 TraceCheckUtils]: 150: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,255 INFO L290 TraceCheckUtils]: 149: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,255 INFO L290 TraceCheckUtils]: 148: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,256 INFO L290 TraceCheckUtils]: 147: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,256 INFO L290 TraceCheckUtils]: 146: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,256 INFO L290 TraceCheckUtils]: 145: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,256 INFO L290 TraceCheckUtils]: 144: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,256 INFO L290 TraceCheckUtils]: 143: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,256 INFO L290 TraceCheckUtils]: 142: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,257 INFO L290 TraceCheckUtils]: 141: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,257 INFO L290 TraceCheckUtils]: 140: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,257 INFO L290 TraceCheckUtils]: 139: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,257 INFO L290 TraceCheckUtils]: 138: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,257 INFO L290 TraceCheckUtils]: 137: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,258 INFO L290 TraceCheckUtils]: 136: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,258 INFO L290 TraceCheckUtils]: 135: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,258 INFO L290 TraceCheckUtils]: 134: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,258 INFO L290 TraceCheckUtils]: 133: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,258 INFO L290 TraceCheckUtils]: 132: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,258 INFO L290 TraceCheckUtils]: 131: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,259 INFO L290 TraceCheckUtils]: 130: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,259 INFO L290 TraceCheckUtils]: 129: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,259 INFO L290 TraceCheckUtils]: 128: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,259 INFO L290 TraceCheckUtils]: 127: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,259 INFO L290 TraceCheckUtils]: 126: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,259 INFO L290 TraceCheckUtils]: 125: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,260 INFO L290 TraceCheckUtils]: 124: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,260 INFO L290 TraceCheckUtils]: 123: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,260 INFO L290 TraceCheckUtils]: 122: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,260 INFO L290 TraceCheckUtils]: 121: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,260 INFO L290 TraceCheckUtils]: 120: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,260 INFO L290 TraceCheckUtils]: 119: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,261 INFO L290 TraceCheckUtils]: 118: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,261 INFO L290 TraceCheckUtils]: 117: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,261 INFO L290 TraceCheckUtils]: 116: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,261 INFO L290 TraceCheckUtils]: 115: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,261 INFO L290 TraceCheckUtils]: 114: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,261 INFO L290 TraceCheckUtils]: 113: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,262 INFO L290 TraceCheckUtils]: 112: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,262 INFO L290 TraceCheckUtils]: 111: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,262 INFO L290 TraceCheckUtils]: 110: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,263 INFO L290 TraceCheckUtils]: 101: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,264 INFO L290 TraceCheckUtils]: 100: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,264 INFO L290 TraceCheckUtils]: 99: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,264 INFO L290 TraceCheckUtils]: 98: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,264 INFO L290 TraceCheckUtils]: 97: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,264 INFO L290 TraceCheckUtils]: 96: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,264 INFO L290 TraceCheckUtils]: 95: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,265 INFO L290 TraceCheckUtils]: 91: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,265 INFO L290 TraceCheckUtils]: 90: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,265 INFO L290 TraceCheckUtils]: 89: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,266 INFO L290 TraceCheckUtils]: 88: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,266 INFO L290 TraceCheckUtils]: 86: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,266 INFO L290 TraceCheckUtils]: 85: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,267 INFO L290 TraceCheckUtils]: 78: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 77: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 76: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 75: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 70: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 64: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,269 INFO L290 TraceCheckUtils]: 57: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {11554#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {11554#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {11554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {11554#true} is VALID [2022-02-20 14:19:06,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {11554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {11554#true} is VALID [2022-02-20 14:19:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11899 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 11863 trivial. 0 not checked. [2022-02-20 14:19:06,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930899144] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:19:06,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:19:06,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2022-02-20 14:19:06,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246384730] [2022-02-20 14:19:06,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:19:06,279 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2022-02-20 14:19:06,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:06,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:06,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:06,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-20 14:19:06,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:06,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-20 14:19:06,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2022-02-20 14:19:06,359 INFO L87 Difference]: Start difference. First operand 259 states and 263 transitions. Second operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:06,709 INFO L93 Difference]: Finished difference Result 333 states and 351 transitions. [2022-02-20 14:19:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 14:19:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2022-02-20 14:19:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 114 transitions. [2022-02-20 14:19:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 114 transitions. [2022-02-20 14:19:06,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 114 transitions. [2022-02-20 14:19:06,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:06,804 INFO L225 Difference]: With dead ends: 333 [2022-02-20 14:19:06,804 INFO L226 Difference]: Without dead ends: 278 [2022-02-20 14:19:06,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2022-02-20 14:19:06,805 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:06,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 217 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:19:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-02-20 14:19:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2022-02-20 14:19:06,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:06,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 277 states, 272 states have (on average 1.0110294117647058) internal successors, (275), 272 states have internal predecessors, (275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:06,894 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 277 states, 272 states have (on average 1.0110294117647058) internal successors, (275), 272 states have internal predecessors, (275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:06,894 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 277 states, 272 states have (on average 1.0110294117647058) internal successors, (275), 272 states have internal predecessors, (275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:06,900 INFO L93 Difference]: Finished difference Result 278 states and 282 transitions. [2022-02-20 14:19:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 282 transitions. [2022-02-20 14:19:06,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:06,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:06,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 272 states have (on average 1.0110294117647058) internal successors, (275), 272 states have internal predecessors, (275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 278 states. [2022-02-20 14:19:06,903 INFO L87 Difference]: Start difference. First operand has 277 states, 272 states have (on average 1.0110294117647058) internal successors, (275), 272 states have internal predecessors, (275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 278 states. [2022-02-20 14:19:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:06,909 INFO L93 Difference]: Finished difference Result 278 states and 282 transitions. [2022-02-20 14:19:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 282 transitions. [2022-02-20 14:19:06,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:06,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:06,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:06,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.0110294117647058) internal successors, (275), 272 states have internal predecessors, (275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 281 transitions. [2022-02-20 14:19:06,916 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 281 transitions. Word has length 324 [2022-02-20 14:19:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:06,917 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 281 transitions. [2022-02-20 14:19:06,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-02-20 14:19:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2022-02-20 14:19:06,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:06,922 INFO L514 BasicCegarLoop]: trace histogram [100, 100, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:06,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 14:19:07,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 14:19:07,129 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash -265776695, now seen corresponding path program 10 times [2022-02-20 14:19:07,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:07,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225551591] [2022-02-20 14:19:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-02-20 14:19:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:07,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15194#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:07,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {15194#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15194#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:07,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {15194#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15195#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:07,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {15195#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15195#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:07,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {15195#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15196#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:07,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {15196#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15196#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:07,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {15196#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15197#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:07,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {15197#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15197#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:07,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {15197#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15198#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:07,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {15198#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15198#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:07,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {15198#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15199#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:07,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {15199#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15199#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:07,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {15199#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15200#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:07,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {15200#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15200#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:07,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {15200#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15201#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:07,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {15201#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15201#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:07,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {15201#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15202#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:07,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {15202#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15202#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:07,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {15202#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15203#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:07,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {15203#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15203#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:07,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {15203#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15204#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:07,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {15204#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15204#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:07,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {15204#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15205#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:07,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {15205#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15205#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:07,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {15205#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15206#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:07,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {15206#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15206#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:07,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {15206#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15207#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:07,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {15207#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15207#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:07,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {15207#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15208#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:07,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {15208#(<= xor_~i~0 15)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15208#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:07,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {15208#(<= xor_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15209#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:07,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {15209#(<= xor_~i~0 16)} assume !(~i~0 < 100); {15088#false} is VALID [2022-02-20 14:19:07,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {15088#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15088#false} is VALID [2022-02-20 14:19:07,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {15088#false} assume true; {15088#false} is VALID [2022-02-20 14:19:07,663 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15088#false} {15087#true} #65#return; {15088#false} is VALID [2022-02-20 14:19:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-02-20 14:19:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:07,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:07,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:07,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:07,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:07,710 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15087#true} {15088#false} #67#return; {15088#false} is VALID [2022-02-20 14:19:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-02-20 14:19:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:07,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:07,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:07,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:07,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:07,734 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15087#true} {15088#false} #69#return; {15088#false} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {15087#true} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {15087#true} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 72: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 76: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 77: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 79: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 80: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 82: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,746 INFO L290 TraceCheckUtils]: 83: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 87: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,747 INFO L290 TraceCheckUtils]: 90: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 91: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 92: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 93: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 94: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 95: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 96: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,748 INFO L290 TraceCheckUtils]: 97: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 98: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 99: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 100: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 101: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 102: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 103: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,749 INFO L290 TraceCheckUtils]: 104: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 105: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 106: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 107: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 108: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 109: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 110: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 111: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,750 INFO L290 TraceCheckUtils]: 112: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,751 INFO L290 TraceCheckUtils]: 113: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,751 INFO L290 TraceCheckUtils]: 114: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,751 INFO L290 TraceCheckUtils]: 115: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,751 INFO L290 TraceCheckUtils]: 116: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,751 INFO L290 TraceCheckUtils]: 117: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,751 INFO L290 TraceCheckUtils]: 118: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 119: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 120: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 121: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 122: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 123: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 124: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,752 INFO L290 TraceCheckUtils]: 125: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 126: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 127: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 128: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 129: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 130: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 131: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 132: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,753 INFO L290 TraceCheckUtils]: 133: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 134: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 135: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 136: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 137: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 138: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 139: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,754 INFO L290 TraceCheckUtils]: 140: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,755 INFO L290 TraceCheckUtils]: 141: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,755 INFO L290 TraceCheckUtils]: 142: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,755 INFO L290 TraceCheckUtils]: 143: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,755 INFO L290 TraceCheckUtils]: 144: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,755 INFO L290 TraceCheckUtils]: 145: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,755 INFO L290 TraceCheckUtils]: 146: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 147: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 148: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 149: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 150: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 151: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 152: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 153: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,756 INFO L290 TraceCheckUtils]: 154: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 155: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 156: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 157: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 158: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 159: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 160: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,757 INFO L290 TraceCheckUtils]: 161: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 162: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 163: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 164: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 165: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 166: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 167: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,758 INFO L290 TraceCheckUtils]: 168: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,759 INFO L290 TraceCheckUtils]: 169: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,759 INFO L290 TraceCheckUtils]: 170: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,759 INFO L290 TraceCheckUtils]: 171: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,759 INFO L290 TraceCheckUtils]: 172: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,759 INFO L290 TraceCheckUtils]: 173: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,759 INFO L290 TraceCheckUtils]: 174: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 175: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 176: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 177: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 178: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 179: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 180: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,760 INFO L290 TraceCheckUtils]: 181: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 182: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 183: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 184: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 185: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 186: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 187: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,761 INFO L290 TraceCheckUtils]: 188: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 189: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 190: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 191: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 192: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 193: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 194: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,762 INFO L290 TraceCheckUtils]: 195: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 196: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 197: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 198: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 199: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 200: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 201: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:07,763 INFO L290 TraceCheckUtils]: 202: Hoare triple {15087#true} assume !(main_~i~1#1 < 100); {15087#true} is VALID [2022-02-20 14:19:07,764 INFO L272 TraceCheckUtils]: 203: Hoare triple {15087#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:07,764 INFO L290 TraceCheckUtils]: 204: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15194#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:07,765 INFO L290 TraceCheckUtils]: 205: Hoare triple {15194#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15194#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:07,765 INFO L290 TraceCheckUtils]: 206: Hoare triple {15194#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15195#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:07,765 INFO L290 TraceCheckUtils]: 207: Hoare triple {15195#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15195#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:07,766 INFO L290 TraceCheckUtils]: 208: Hoare triple {15195#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15196#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:07,766 INFO L290 TraceCheckUtils]: 209: Hoare triple {15196#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15196#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:07,767 INFO L290 TraceCheckUtils]: 210: Hoare triple {15196#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15197#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:07,767 INFO L290 TraceCheckUtils]: 211: Hoare triple {15197#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15197#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:07,768 INFO L290 TraceCheckUtils]: 212: Hoare triple {15197#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15198#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:07,768 INFO L290 TraceCheckUtils]: 213: Hoare triple {15198#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15198#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:07,768 INFO L290 TraceCheckUtils]: 214: Hoare triple {15198#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15199#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:07,769 INFO L290 TraceCheckUtils]: 215: Hoare triple {15199#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15199#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:07,769 INFO L290 TraceCheckUtils]: 216: Hoare triple {15199#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15200#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:07,769 INFO L290 TraceCheckUtils]: 217: Hoare triple {15200#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15200#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:07,770 INFO L290 TraceCheckUtils]: 218: Hoare triple {15200#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15201#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:07,770 INFO L290 TraceCheckUtils]: 219: Hoare triple {15201#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15201#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:07,771 INFO L290 TraceCheckUtils]: 220: Hoare triple {15201#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15202#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:07,771 INFO L290 TraceCheckUtils]: 221: Hoare triple {15202#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15202#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:07,771 INFO L290 TraceCheckUtils]: 222: Hoare triple {15202#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15203#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:07,772 INFO L290 TraceCheckUtils]: 223: Hoare triple {15203#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15203#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:07,772 INFO L290 TraceCheckUtils]: 224: Hoare triple {15203#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15204#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:07,773 INFO L290 TraceCheckUtils]: 225: Hoare triple {15204#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15204#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:07,773 INFO L290 TraceCheckUtils]: 226: Hoare triple {15204#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15205#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:07,773 INFO L290 TraceCheckUtils]: 227: Hoare triple {15205#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15205#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:07,774 INFO L290 TraceCheckUtils]: 228: Hoare triple {15205#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15206#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:07,774 INFO L290 TraceCheckUtils]: 229: Hoare triple {15206#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15206#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:07,775 INFO L290 TraceCheckUtils]: 230: Hoare triple {15206#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15207#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:07,775 INFO L290 TraceCheckUtils]: 231: Hoare triple {15207#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15207#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:07,775 INFO L290 TraceCheckUtils]: 232: Hoare triple {15207#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15208#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:07,776 INFO L290 TraceCheckUtils]: 233: Hoare triple {15208#(<= xor_~i~0 15)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15208#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:07,776 INFO L290 TraceCheckUtils]: 234: Hoare triple {15208#(<= xor_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15209#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:07,777 INFO L290 TraceCheckUtils]: 235: Hoare triple {15209#(<= xor_~i~0 16)} assume !(~i~0 < 100); {15088#false} is VALID [2022-02-20 14:19:07,777 INFO L290 TraceCheckUtils]: 236: Hoare triple {15088#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15088#false} is VALID [2022-02-20 14:19:07,777 INFO L290 TraceCheckUtils]: 237: Hoare triple {15088#false} assume true; {15088#false} is VALID [2022-02-20 14:19:07,777 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {15088#false} {15087#true} #65#return; {15088#false} is VALID [2022-02-20 14:19:07,777 INFO L290 TraceCheckUtils]: 239: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {15088#false} is VALID [2022-02-20 14:19:07,777 INFO L272 TraceCheckUtils]: 240: Hoare triple {15088#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:07,777 INFO L290 TraceCheckUtils]: 241: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 242: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 243: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 244: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 245: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 246: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 247: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,778 INFO L290 TraceCheckUtils]: 248: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 249: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 250: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 251: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 252: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 253: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 254: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,779 INFO L290 TraceCheckUtils]: 255: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 256: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 257: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 258: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 259: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 260: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 261: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,780 INFO L290 TraceCheckUtils]: 262: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 263: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 264: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 265: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 266: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 267: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 268: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,781 INFO L290 TraceCheckUtils]: 269: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 270: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 271: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 272: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 273: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 274: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:07,782 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {15087#true} {15088#false} #67#return; {15088#false} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 276: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {15088#false} is VALID [2022-02-20 14:19:07,782 INFO L290 TraceCheckUtils]: 277: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 278: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 279: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 280: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 281: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 282: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 283: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,783 INFO L290 TraceCheckUtils]: 284: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 285: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 286: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 287: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 288: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 289: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 290: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,784 INFO L290 TraceCheckUtils]: 291: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 292: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 293: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 294: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 295: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 296: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 297: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,785 INFO L290 TraceCheckUtils]: 298: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 299: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 300: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 301: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 302: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 303: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 304: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:07,786 INFO L290 TraceCheckUtils]: 305: Hoare triple {15088#false} assume !(main_~i~2#1 < 99); {15088#false} is VALID [2022-02-20 14:19:07,787 INFO L290 TraceCheckUtils]: 306: Hoare triple {15088#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {15088#false} is VALID [2022-02-20 14:19:07,787 INFO L272 TraceCheckUtils]: 307: Hoare triple {15088#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:07,787 INFO L290 TraceCheckUtils]: 308: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:07,787 INFO L290 TraceCheckUtils]: 309: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,787 INFO L290 TraceCheckUtils]: 310: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,787 INFO L290 TraceCheckUtils]: 311: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,787 INFO L290 TraceCheckUtils]: 312: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 313: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 314: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 315: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 316: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 317: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 318: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,788 INFO L290 TraceCheckUtils]: 319: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 320: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 321: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 322: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 323: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 324: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 325: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,789 INFO L290 TraceCheckUtils]: 326: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 327: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 328: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 329: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 330: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 331: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 332: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 333: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,790 INFO L290 TraceCheckUtils]: 334: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 335: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 336: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 337: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 338: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 339: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 340: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:07,791 INFO L290 TraceCheckUtils]: 341: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:07,792 INFO L284 TraceCheckUtils]: 342: Hoare quadruple {15087#true} {15088#false} #69#return; {15088#false} is VALID [2022-02-20 14:19:07,792 INFO L290 TraceCheckUtils]: 343: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {15088#false} is VALID [2022-02-20 14:19:07,792 INFO L290 TraceCheckUtils]: 344: Hoare triple {15088#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {15088#false} is VALID [2022-02-20 14:19:07,792 INFO L290 TraceCheckUtils]: 345: Hoare triple {15088#false} assume !false; {15088#false} is VALID [2022-02-20 14:19:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12326 backedges. 0 proven. 1193 refuted. 0 times theorem prover too weak. 11133 trivial. 0 not checked. [2022-02-20 14:19:07,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:07,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225551591] [2022-02-20 14:19:07,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225551591] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:19:07,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119985619] [2022-02-20 14:19:07,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:19:07,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:19:07,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:19:07,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 14:19:08,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:19:08,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:19:08,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 14:19:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:08,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 75: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 76: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 77: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 83: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 90: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 91: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 92: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 93: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 94: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,161 INFO L290 TraceCheckUtils]: 99: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 100: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 101: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 102: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 103: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 104: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 105: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 106: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 107: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 108: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 109: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 110: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 111: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 112: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 113: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,162 INFO L290 TraceCheckUtils]: 114: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 115: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 116: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 117: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 118: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 119: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 120: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 121: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 122: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 123: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 124: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 125: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 126: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 127: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 128: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,163 INFO L290 TraceCheckUtils]: 129: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 130: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 131: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 132: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 133: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 134: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 135: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 136: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 137: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 138: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 139: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 140: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 141: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 142: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 143: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,164 INFO L290 TraceCheckUtils]: 144: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 145: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 146: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 147: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 148: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 149: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 150: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 151: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 152: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 153: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 154: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,165 INFO L290 TraceCheckUtils]: 155: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 156: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 157: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 158: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 159: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 160: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 161: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,166 INFO L290 TraceCheckUtils]: 162: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 163: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 164: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 165: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 166: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 167: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 168: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,167 INFO L290 TraceCheckUtils]: 169: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 170: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 171: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 172: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 173: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 174: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 175: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,168 INFO L290 TraceCheckUtils]: 176: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,169 INFO L290 TraceCheckUtils]: 177: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,169 INFO L290 TraceCheckUtils]: 178: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,169 INFO L290 TraceCheckUtils]: 179: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,169 INFO L290 TraceCheckUtils]: 180: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,169 INFO L290 TraceCheckUtils]: 181: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,169 INFO L290 TraceCheckUtils]: 182: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 183: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 184: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 185: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 186: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 187: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 188: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,170 INFO L290 TraceCheckUtils]: 189: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 190: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 191: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 192: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 193: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 194: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 195: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,171 INFO L290 TraceCheckUtils]: 196: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L290 TraceCheckUtils]: 197: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L290 TraceCheckUtils]: 198: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L290 TraceCheckUtils]: 199: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L290 TraceCheckUtils]: 200: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L290 TraceCheckUtils]: 201: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L290 TraceCheckUtils]: 202: Hoare triple {15087#true} assume !(main_~i~1#1 < 100); {15087#true} is VALID [2022-02-20 14:19:09,172 INFO L272 TraceCheckUtils]: 203: Hoare triple {15087#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 204: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 205: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 206: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 207: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 208: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 209: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,173 INFO L290 TraceCheckUtils]: 210: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 211: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 212: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 213: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 214: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 215: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 216: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,174 INFO L290 TraceCheckUtils]: 217: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,175 INFO L290 TraceCheckUtils]: 218: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,175 INFO L290 TraceCheckUtils]: 219: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,175 INFO L290 TraceCheckUtils]: 220: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,175 INFO L290 TraceCheckUtils]: 221: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,175 INFO L290 TraceCheckUtils]: 222: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,175 INFO L290 TraceCheckUtils]: 223: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 224: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 225: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 226: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 227: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 228: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 229: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,176 INFO L290 TraceCheckUtils]: 230: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 231: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 232: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 233: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 234: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 235: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 236: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:09,177 INFO L290 TraceCheckUtils]: 237: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:09,178 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {15087#true} {15087#true} #65#return; {15087#true} is VALID [2022-02-20 14:19:09,178 INFO L290 TraceCheckUtils]: 239: Hoare triple {15087#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {15087#true} is VALID [2022-02-20 14:19:09,178 INFO L272 TraceCheckUtils]: 240: Hoare triple {15087#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:09,179 INFO L290 TraceCheckUtils]: 241: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15194#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:09,180 INFO L290 TraceCheckUtils]: 242: Hoare triple {15194#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15194#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:09,180 INFO L290 TraceCheckUtils]: 243: Hoare triple {15194#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15195#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:09,181 INFO L290 TraceCheckUtils]: 244: Hoare triple {15195#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15195#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:09,181 INFO L290 TraceCheckUtils]: 245: Hoare triple {15195#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15196#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:09,181 INFO L290 TraceCheckUtils]: 246: Hoare triple {15196#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15196#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:09,182 INFO L290 TraceCheckUtils]: 247: Hoare triple {15196#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15197#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:09,182 INFO L290 TraceCheckUtils]: 248: Hoare triple {15197#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15197#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:09,183 INFO L290 TraceCheckUtils]: 249: Hoare triple {15197#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15198#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:09,183 INFO L290 TraceCheckUtils]: 250: Hoare triple {15198#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15198#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:09,184 INFO L290 TraceCheckUtils]: 251: Hoare triple {15198#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15199#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:09,184 INFO L290 TraceCheckUtils]: 252: Hoare triple {15199#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15199#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:09,184 INFO L290 TraceCheckUtils]: 253: Hoare triple {15199#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15200#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:09,185 INFO L290 TraceCheckUtils]: 254: Hoare triple {15200#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15200#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:09,185 INFO L290 TraceCheckUtils]: 255: Hoare triple {15200#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15201#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:09,186 INFO L290 TraceCheckUtils]: 256: Hoare triple {15201#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15201#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:09,186 INFO L290 TraceCheckUtils]: 257: Hoare triple {15201#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15202#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:09,186 INFO L290 TraceCheckUtils]: 258: Hoare triple {15202#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15202#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:09,187 INFO L290 TraceCheckUtils]: 259: Hoare triple {15202#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15203#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:09,187 INFO L290 TraceCheckUtils]: 260: Hoare triple {15203#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15203#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:09,188 INFO L290 TraceCheckUtils]: 261: Hoare triple {15203#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15204#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:09,188 INFO L290 TraceCheckUtils]: 262: Hoare triple {15204#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15204#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:09,189 INFO L290 TraceCheckUtils]: 263: Hoare triple {15204#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15205#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:09,189 INFO L290 TraceCheckUtils]: 264: Hoare triple {15205#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15205#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:09,189 INFO L290 TraceCheckUtils]: 265: Hoare triple {15205#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15206#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:09,190 INFO L290 TraceCheckUtils]: 266: Hoare triple {15206#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15206#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:09,190 INFO L290 TraceCheckUtils]: 267: Hoare triple {15206#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15207#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:09,191 INFO L290 TraceCheckUtils]: 268: Hoare triple {15207#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15207#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:09,191 INFO L290 TraceCheckUtils]: 269: Hoare triple {15207#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15208#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:09,191 INFO L290 TraceCheckUtils]: 270: Hoare triple {15208#(<= xor_~i~0 15)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15208#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:09,192 INFO L290 TraceCheckUtils]: 271: Hoare triple {15208#(<= xor_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15209#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:09,192 INFO L290 TraceCheckUtils]: 272: Hoare triple {15209#(<= xor_~i~0 16)} assume !(~i~0 < 100); {15088#false} is VALID [2022-02-20 14:19:09,192 INFO L290 TraceCheckUtils]: 273: Hoare triple {15088#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L290 TraceCheckUtils]: 274: Hoare triple {15088#false} assume true; {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {15088#false} {15087#true} #67#return; {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L290 TraceCheckUtils]: 276: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L290 TraceCheckUtils]: 277: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L290 TraceCheckUtils]: 278: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L290 TraceCheckUtils]: 279: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,193 INFO L290 TraceCheckUtils]: 280: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 281: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 282: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 283: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 284: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 285: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 286: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,194 INFO L290 TraceCheckUtils]: 287: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,195 INFO L290 TraceCheckUtils]: 288: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,195 INFO L290 TraceCheckUtils]: 289: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,195 INFO L290 TraceCheckUtils]: 290: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,195 INFO L290 TraceCheckUtils]: 291: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,195 INFO L290 TraceCheckUtils]: 292: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,195 INFO L290 TraceCheckUtils]: 293: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 294: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 295: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 296: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 297: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 298: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 299: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,196 INFO L290 TraceCheckUtils]: 300: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L290 TraceCheckUtils]: 301: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L290 TraceCheckUtils]: 302: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L290 TraceCheckUtils]: 303: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L290 TraceCheckUtils]: 304: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L290 TraceCheckUtils]: 305: Hoare triple {15088#false} assume !(main_~i~2#1 < 99); {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L290 TraceCheckUtils]: 306: Hoare triple {15088#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {15088#false} is VALID [2022-02-20 14:19:09,197 INFO L272 TraceCheckUtils]: 307: Hoare triple {15088#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 308: Hoare triple {15088#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 309: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 310: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 311: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 312: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 313: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,198 INFO L290 TraceCheckUtils]: 314: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 315: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 316: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 317: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 318: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 319: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 320: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,199 INFO L290 TraceCheckUtils]: 321: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 322: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 323: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 324: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 325: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 326: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 327: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 328: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,200 INFO L290 TraceCheckUtils]: 329: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 330: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 331: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 332: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 333: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 334: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 335: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,201 INFO L290 TraceCheckUtils]: 336: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L290 TraceCheckUtils]: 337: Hoare triple {15088#false} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L290 TraceCheckUtils]: 338: Hoare triple {15088#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L290 TraceCheckUtils]: 339: Hoare triple {15088#false} assume !(~i~0 < 100); {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L290 TraceCheckUtils]: 340: Hoare triple {15088#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L290 TraceCheckUtils]: 341: Hoare triple {15088#false} assume true; {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L284 TraceCheckUtils]: 342: Hoare quadruple {15088#false} {15088#false} #69#return; {15088#false} is VALID [2022-02-20 14:19:09,202 INFO L290 TraceCheckUtils]: 343: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {15088#false} is VALID [2022-02-20 14:19:09,203 INFO L290 TraceCheckUtils]: 344: Hoare triple {15088#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {15088#false} is VALID [2022-02-20 14:19:09,203 INFO L290 TraceCheckUtils]: 345: Hoare triple {15088#false} assume !false; {15088#false} is VALID [2022-02-20 14:19:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12326 backedges. 1451 proven. 225 refuted. 0 times theorem prover too weak. 10650 trivial. 0 not checked. [2022-02-20 14:19:09,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:19:10,166 INFO L290 TraceCheckUtils]: 345: Hoare triple {15088#false} assume !false; {15088#false} is VALID [2022-02-20 14:19:10,166 INFO L290 TraceCheckUtils]: 344: Hoare triple {15088#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {15088#false} is VALID [2022-02-20 14:19:10,166 INFO L290 TraceCheckUtils]: 343: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {15088#false} is VALID [2022-02-20 14:19:10,166 INFO L284 TraceCheckUtils]: 342: Hoare quadruple {15087#true} {15088#false} #69#return; {15088#false} is VALID [2022-02-20 14:19:10,166 INFO L290 TraceCheckUtils]: 341: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:10,166 INFO L290 TraceCheckUtils]: 340: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:10,166 INFO L290 TraceCheckUtils]: 339: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 338: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 337: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 336: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 335: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 334: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 333: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 332: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 331: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 330: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 329: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 328: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 327: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 326: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 325: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,167 INFO L290 TraceCheckUtils]: 324: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 323: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 322: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 321: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 320: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 319: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 318: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 317: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 316: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 315: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 314: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 313: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 312: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 311: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,168 INFO L290 TraceCheckUtils]: 310: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 309: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 308: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:10,169 INFO L272 TraceCheckUtils]: 307: Hoare triple {15088#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 306: Hoare triple {15088#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 305: Hoare triple {15088#false} assume !(main_~i~2#1 < 99); {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 304: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 303: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 302: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 301: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 300: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 299: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 298: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 297: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 296: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,169 INFO L290 TraceCheckUtils]: 295: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 294: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 293: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 292: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 291: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 290: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 289: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 288: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 287: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,170 INFO L290 TraceCheckUtils]: 286: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 285: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 284: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 283: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 282: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 281: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 280: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,171 INFO L290 TraceCheckUtils]: 279: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,172 INFO L290 TraceCheckUtils]: 278: Hoare triple {15088#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {15088#false} is VALID [2022-02-20 14:19:10,172 INFO L290 TraceCheckUtils]: 277: Hoare triple {15088#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {15088#false} is VALID [2022-02-20 14:19:10,172 INFO L290 TraceCheckUtils]: 276: Hoare triple {15088#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {15088#false} is VALID [2022-02-20 14:19:10,172 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {15088#false} {15087#true} #67#return; {15088#false} is VALID [2022-02-20 14:19:10,172 INFO L290 TraceCheckUtils]: 274: Hoare triple {15088#false} assume true; {15088#false} is VALID [2022-02-20 14:19:10,172 INFO L290 TraceCheckUtils]: 273: Hoare triple {15088#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15088#false} is VALID [2022-02-20 14:19:10,179 INFO L290 TraceCheckUtils]: 272: Hoare triple {16470#(< xor_~i~0 100)} assume !(~i~0 < 100); {15088#false} is VALID [2022-02-20 14:19:10,180 INFO L290 TraceCheckUtils]: 271: Hoare triple {16474#(< xor_~i~0 99)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16470#(< xor_~i~0 100)} is VALID [2022-02-20 14:19:10,180 INFO L290 TraceCheckUtils]: 270: Hoare triple {16474#(< xor_~i~0 99)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16474#(< xor_~i~0 99)} is VALID [2022-02-20 14:19:10,181 INFO L290 TraceCheckUtils]: 269: Hoare triple {16481#(< xor_~i~0 98)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16474#(< xor_~i~0 99)} is VALID [2022-02-20 14:19:10,181 INFO L290 TraceCheckUtils]: 268: Hoare triple {16481#(< xor_~i~0 98)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16481#(< xor_~i~0 98)} is VALID [2022-02-20 14:19:10,182 INFO L290 TraceCheckUtils]: 267: Hoare triple {16488#(< xor_~i~0 97)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16481#(< xor_~i~0 98)} is VALID [2022-02-20 14:19:10,182 INFO L290 TraceCheckUtils]: 266: Hoare triple {16488#(< xor_~i~0 97)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16488#(< xor_~i~0 97)} is VALID [2022-02-20 14:19:10,182 INFO L290 TraceCheckUtils]: 265: Hoare triple {16495#(< xor_~i~0 96)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16488#(< xor_~i~0 97)} is VALID [2022-02-20 14:19:10,183 INFO L290 TraceCheckUtils]: 264: Hoare triple {16495#(< xor_~i~0 96)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16495#(< xor_~i~0 96)} is VALID [2022-02-20 14:19:10,183 INFO L290 TraceCheckUtils]: 263: Hoare triple {16502#(< xor_~i~0 95)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16495#(< xor_~i~0 96)} is VALID [2022-02-20 14:19:10,184 INFO L290 TraceCheckUtils]: 262: Hoare triple {16502#(< xor_~i~0 95)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16502#(< xor_~i~0 95)} is VALID [2022-02-20 14:19:10,184 INFO L290 TraceCheckUtils]: 261: Hoare triple {16509#(< xor_~i~0 94)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16502#(< xor_~i~0 95)} is VALID [2022-02-20 14:19:10,185 INFO L290 TraceCheckUtils]: 260: Hoare triple {16509#(< xor_~i~0 94)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16509#(< xor_~i~0 94)} is VALID [2022-02-20 14:19:10,185 INFO L290 TraceCheckUtils]: 259: Hoare triple {16516#(< xor_~i~0 93)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16509#(< xor_~i~0 94)} is VALID [2022-02-20 14:19:10,185 INFO L290 TraceCheckUtils]: 258: Hoare triple {16516#(< xor_~i~0 93)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16516#(< xor_~i~0 93)} is VALID [2022-02-20 14:19:10,186 INFO L290 TraceCheckUtils]: 257: Hoare triple {16523#(< xor_~i~0 92)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16516#(< xor_~i~0 93)} is VALID [2022-02-20 14:19:10,186 INFO L290 TraceCheckUtils]: 256: Hoare triple {16523#(< xor_~i~0 92)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16523#(< xor_~i~0 92)} is VALID [2022-02-20 14:19:10,187 INFO L290 TraceCheckUtils]: 255: Hoare triple {16530#(< xor_~i~0 91)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16523#(< xor_~i~0 92)} is VALID [2022-02-20 14:19:10,187 INFO L290 TraceCheckUtils]: 254: Hoare triple {16530#(< xor_~i~0 91)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16530#(< xor_~i~0 91)} is VALID [2022-02-20 14:19:10,188 INFO L290 TraceCheckUtils]: 253: Hoare triple {16537#(< xor_~i~0 90)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16530#(< xor_~i~0 91)} is VALID [2022-02-20 14:19:10,188 INFO L290 TraceCheckUtils]: 252: Hoare triple {16537#(< xor_~i~0 90)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16537#(< xor_~i~0 90)} is VALID [2022-02-20 14:19:10,189 INFO L290 TraceCheckUtils]: 251: Hoare triple {16544#(< xor_~i~0 89)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16537#(< xor_~i~0 90)} is VALID [2022-02-20 14:19:10,189 INFO L290 TraceCheckUtils]: 250: Hoare triple {16544#(< xor_~i~0 89)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16544#(< xor_~i~0 89)} is VALID [2022-02-20 14:19:10,190 INFO L290 TraceCheckUtils]: 249: Hoare triple {16551#(< xor_~i~0 88)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16544#(< xor_~i~0 89)} is VALID [2022-02-20 14:19:10,190 INFO L290 TraceCheckUtils]: 248: Hoare triple {16551#(< xor_~i~0 88)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16551#(< xor_~i~0 88)} is VALID [2022-02-20 14:19:10,190 INFO L290 TraceCheckUtils]: 247: Hoare triple {16558#(< xor_~i~0 87)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16551#(< xor_~i~0 88)} is VALID [2022-02-20 14:19:10,191 INFO L290 TraceCheckUtils]: 246: Hoare triple {16558#(< xor_~i~0 87)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16558#(< xor_~i~0 87)} is VALID [2022-02-20 14:19:10,191 INFO L290 TraceCheckUtils]: 245: Hoare triple {16565#(< xor_~i~0 86)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16558#(< xor_~i~0 87)} is VALID [2022-02-20 14:19:10,191 INFO L290 TraceCheckUtils]: 244: Hoare triple {16565#(< xor_~i~0 86)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16565#(< xor_~i~0 86)} is VALID [2022-02-20 14:19:10,192 INFO L290 TraceCheckUtils]: 243: Hoare triple {16572#(< xor_~i~0 85)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16565#(< xor_~i~0 86)} is VALID [2022-02-20 14:19:10,192 INFO L290 TraceCheckUtils]: 242: Hoare triple {16572#(< xor_~i~0 85)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {16572#(< xor_~i~0 85)} is VALID [2022-02-20 14:19:10,192 INFO L290 TraceCheckUtils]: 241: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {16572#(< xor_~i~0 85)} is VALID [2022-02-20 14:19:10,192 INFO L272 TraceCheckUtils]: 240: Hoare triple {15087#true} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:10,192 INFO L290 TraceCheckUtils]: 239: Hoare triple {15087#true} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {15087#true} {15087#true} #65#return; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 237: Hoare triple {15087#true} assume true; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 236: Hoare triple {15087#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 235: Hoare triple {15087#true} assume !(~i~0 < 100); {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 234: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 233: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 232: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 231: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 230: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 229: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 228: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 227: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 226: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 225: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 224: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,193 INFO L290 TraceCheckUtils]: 223: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 222: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 221: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 220: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 219: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 218: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 217: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 216: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 215: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 214: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 213: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 212: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 211: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 210: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 209: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,194 INFO L290 TraceCheckUtils]: 208: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 207: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 206: Hoare triple {15087#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 205: Hoare triple {15087#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 204: Hoare triple {15087#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L272 TraceCheckUtils]: 203: Hoare triple {15087#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 202: Hoare triple {15087#true} assume !(main_~i~1#1 < 100); {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 201: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 200: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 199: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 198: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 197: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,195 INFO L290 TraceCheckUtils]: 196: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 195: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 194: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 193: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 192: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 191: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 190: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 189: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 188: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 187: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 186: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 185: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 184: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 183: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,197 INFO L290 TraceCheckUtils]: 182: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 181: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 180: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 179: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 178: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 177: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 176: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 175: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 174: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 173: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 172: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 171: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,198 INFO L290 TraceCheckUtils]: 170: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,199 INFO L290 TraceCheckUtils]: 169: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,199 INFO L290 TraceCheckUtils]: 168: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,199 INFO L290 TraceCheckUtils]: 167: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,199 INFO L290 TraceCheckUtils]: 166: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,199 INFO L290 TraceCheckUtils]: 165: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 164: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 163: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 162: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 161: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 160: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 159: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,200 INFO L290 TraceCheckUtils]: 158: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 157: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 156: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 155: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 154: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 153: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 152: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,201 INFO L290 TraceCheckUtils]: 151: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 150: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 149: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 148: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 147: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 146: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 145: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,202 INFO L290 TraceCheckUtils]: 144: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 143: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 142: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 141: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 140: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 139: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 138: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,203 INFO L290 TraceCheckUtils]: 137: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 136: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 135: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 134: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 133: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 132: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 131: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,204 INFO L290 TraceCheckUtils]: 130: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 129: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 128: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 127: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 126: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 125: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 124: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,205 INFO L290 TraceCheckUtils]: 123: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 121: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 120: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 119: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 118: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 117: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,206 INFO L290 TraceCheckUtils]: 116: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 115: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 114: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 113: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 112: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 111: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 110: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,207 INFO L290 TraceCheckUtils]: 109: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 108: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 107: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 106: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 105: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 104: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 103: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,208 INFO L290 TraceCheckUtils]: 102: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 101: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 100: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 99: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 98: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 97: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 96: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,209 INFO L290 TraceCheckUtils]: 95: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 91: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 89: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,210 INFO L290 TraceCheckUtils]: 88: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 87: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 86: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 72: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 66: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {15087#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {15087#true} is VALID [2022-02-20 14:19:10,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {15087#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {15087#true} is VALID [2022-02-20 14:19:10,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {15087#true} is VALID [2022-02-20 14:19:10,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {15087#true} is VALID [2022-02-20 14:19:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12326 backedges. 484 proven. 709 refuted. 0 times theorem prover too weak. 11133 trivial. 0 not checked. [2022-02-20 14:19:10,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119985619] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:19:10,225 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:19:10,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2022-02-20 14:19:10,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408355226] [2022-02-20 14:19:10,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:19:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 346 [2022-02-20 14:19:10,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:10,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:10,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:10,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-20 14:19:10,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-20 14:19:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 14:19:10,305 INFO L87 Difference]: Start difference. First operand 277 states and 281 transitions. Second operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:10,613 INFO L93 Difference]: Finished difference Result 384 states and 410 transitions. [2022-02-20 14:19:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-20 14:19:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 346 [2022-02-20 14:19:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 128 transitions. [2022-02-20 14:19:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 128 transitions. [2022-02-20 14:19:10,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 128 transitions. [2022-02-20 14:19:10,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:10,735 INFO L225 Difference]: With dead ends: 384 [2022-02-20 14:19:10,735 INFO L226 Difference]: Without dead ends: 311 [2022-02-20 14:19:10,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 14:19:10,738 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:10,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 112 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:19:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-20 14:19:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-02-20 14:19:10,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:10,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 311 states, 306 states have (on average 1.0098039215686274) internal successors, (309), 306 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:10,844 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 311 states, 306 states have (on average 1.0098039215686274) internal successors, (309), 306 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:10,844 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 311 states, 306 states have (on average 1.0098039215686274) internal successors, (309), 306 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:10,851 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2022-02-20 14:19:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 315 transitions. [2022-02-20 14:19:10,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:10,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:10,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 306 states have (on average 1.0098039215686274) internal successors, (309), 306 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 311 states. [2022-02-20 14:19:10,854 INFO L87 Difference]: Start difference. First operand has 311 states, 306 states have (on average 1.0098039215686274) internal successors, (309), 306 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 311 states. [2022-02-20 14:19:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:10,861 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2022-02-20 14:19:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 315 transitions. [2022-02-20 14:19:10,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:10,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:10,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:10,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 306 states have (on average 1.0098039215686274) internal successors, (309), 306 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:19:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 315 transitions. [2022-02-20 14:19:10,872 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 315 transitions. Word has length 346 [2022-02-20 14:19:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:10,873 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 315 transitions. [2022-02-20 14:19:10,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 14:19:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 315 transitions. [2022-02-20 14:19:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2022-02-20 14:19:10,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:10,880 INFO L514 BasicCegarLoop]: trace histogram [100, 100, 96, 96, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:10,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 14:19:11,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 14:19:11,107 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -901173721, now seen corresponding path program 11 times [2022-02-20 14:19:11,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:11,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435287327] [2022-02-20 14:19:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-02-20 14:19:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:12,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {18955#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {19164#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:12,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {19164#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19164#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:12,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {19164#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19165#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:12,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {19165#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19165#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:12,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {19165#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19166#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:12,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {19166#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19166#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:12,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {19166#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19167#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:12,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {19167#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19167#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:12,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {19167#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19168#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:12,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {19168#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19168#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:12,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {19168#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19169#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:12,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {19169#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19169#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:12,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {19169#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19170#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:12,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {19170#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19170#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:12,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {19170#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19171#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:12,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {19171#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19171#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:12,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {19171#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19172#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:12,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {19172#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19172#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:12,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {19172#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19173#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:12,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {19173#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19173#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:12,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {19173#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:12,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {19174#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19174#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:12,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {19174#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19175#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:12,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {19175#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19175#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:12,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {19175#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19176#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:12,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {19176#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19176#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:12,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {19176#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19177#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:12,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {19177#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19177#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:12,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {19177#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19178#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:12,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {19178#(<= xor_~i~0 15)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19178#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:12,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {19178#(<= xor_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19179#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:12,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {19179#(<= xor_~i~0 16)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19179#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:12,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {19179#(<= xor_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19180#(<= xor_~i~0 17)} is VALID [2022-02-20 14:19:12,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {19180#(<= xor_~i~0 17)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19180#(<= xor_~i~0 17)} is VALID [2022-02-20 14:19:12,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {19180#(<= xor_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19181#(<= xor_~i~0 18)} is VALID [2022-02-20 14:19:12,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {19181#(<= xor_~i~0 18)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19181#(<= xor_~i~0 18)} is VALID [2022-02-20 14:19:12,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {19181#(<= xor_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19182#(<= xor_~i~0 19)} is VALID [2022-02-20 14:19:12,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {19182#(<= xor_~i~0 19)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19182#(<= xor_~i~0 19)} is VALID [2022-02-20 14:19:12,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {19182#(<= xor_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19183#(<= xor_~i~0 20)} is VALID [2022-02-20 14:19:12,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {19183#(<= xor_~i~0 20)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19183#(<= xor_~i~0 20)} is VALID [2022-02-20 14:19:12,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {19183#(<= xor_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19184#(<= xor_~i~0 21)} is VALID [2022-02-20 14:19:12,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {19184#(<= xor_~i~0 21)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19184#(<= xor_~i~0 21)} is VALID [2022-02-20 14:19:12,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {19184#(<= xor_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19185#(<= xor_~i~0 22)} is VALID [2022-02-20 14:19:12,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {19185#(<= xor_~i~0 22)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19185#(<= xor_~i~0 22)} is VALID [2022-02-20 14:19:12,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {19185#(<= xor_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19186#(<= xor_~i~0 23)} is VALID [2022-02-20 14:19:12,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {19186#(<= xor_~i~0 23)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19186#(<= xor_~i~0 23)} is VALID [2022-02-20 14:19:12,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {19186#(<= xor_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19187#(<= xor_~i~0 24)} is VALID [2022-02-20 14:19:12,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {19187#(<= xor_~i~0 24)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19187#(<= xor_~i~0 24)} is VALID [2022-02-20 14:19:12,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {19187#(<= xor_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19188#(<= xor_~i~0 25)} is VALID [2022-02-20 14:19:12,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {19188#(<= xor_~i~0 25)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19188#(<= xor_~i~0 25)} is VALID [2022-02-20 14:19:12,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {19188#(<= xor_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19189#(<= xor_~i~0 26)} is VALID [2022-02-20 14:19:12,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {19189#(<= xor_~i~0 26)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19189#(<= xor_~i~0 26)} is VALID [2022-02-20 14:19:12,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {19189#(<= xor_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19190#(<= xor_~i~0 27)} is VALID [2022-02-20 14:19:12,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {19190#(<= xor_~i~0 27)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19190#(<= xor_~i~0 27)} is VALID [2022-02-20 14:19:12,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {19190#(<= xor_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19191#(<= xor_~i~0 28)} is VALID [2022-02-20 14:19:12,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {19191#(<= xor_~i~0 28)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19191#(<= xor_~i~0 28)} is VALID [2022-02-20 14:19:12,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {19191#(<= xor_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19192#(<= xor_~i~0 29)} is VALID [2022-02-20 14:19:12,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {19192#(<= xor_~i~0 29)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19192#(<= xor_~i~0 29)} is VALID [2022-02-20 14:19:12,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {19192#(<= xor_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19193#(<= xor_~i~0 30)} is VALID [2022-02-20 14:19:12,087 INFO L290 TraceCheckUtils]: 59: Hoare triple {19193#(<= xor_~i~0 30)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19193#(<= xor_~i~0 30)} is VALID [2022-02-20 14:19:12,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {19193#(<= xor_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19194#(<= xor_~i~0 31)} is VALID [2022-02-20 14:19:12,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {19194#(<= xor_~i~0 31)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19194#(<= xor_~i~0 31)} is VALID [2022-02-20 14:19:12,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {19194#(<= xor_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19195#(<= xor_~i~0 32)} is VALID [2022-02-20 14:19:12,088 INFO L290 TraceCheckUtils]: 63: Hoare triple {19195#(<= xor_~i~0 32)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19195#(<= xor_~i~0 32)} is VALID [2022-02-20 14:19:12,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {19195#(<= xor_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19196#(<= xor_~i~0 33)} is VALID [2022-02-20 14:19:12,089 INFO L290 TraceCheckUtils]: 65: Hoare triple {19196#(<= xor_~i~0 33)} assume !(~i~0 < 100); {18956#false} is VALID [2022-02-20 14:19:12,089 INFO L290 TraceCheckUtils]: 66: Hoare triple {18956#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18956#false} is VALID [2022-02-20 14:19:12,089 INFO L290 TraceCheckUtils]: 67: Hoare triple {18956#false} assume true; {18956#false} is VALID [2022-02-20 14:19:12,090 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18956#false} {18955#true} #65#return; {18956#false} is VALID [2022-02-20 14:19:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-02-20 14:19:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:12,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {18955#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {18955#true} is VALID [2022-02-20 14:19:12,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {18955#true} assume !(~i~0 < 100); {18955#true} is VALID [2022-02-20 14:19:12,141 INFO L290 TraceCheckUtils]: 66: Hoare triple {18955#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18955#true} is VALID [2022-02-20 14:19:12,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {18955#true} assume true; {18955#true} is VALID [2022-02-20 14:19:12,141 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18955#true} {18956#false} #67#return; {18956#false} is VALID [2022-02-20 14:19:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-02-20 14:19:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:12,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {18955#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 52: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 62: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {18955#true} assume !(~i~0 < 100); {18955#true} is VALID [2022-02-20 14:19:12,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {18955#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18955#true} is VALID [2022-02-20 14:19:12,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {18955#true} assume true; {18955#true} is VALID [2022-02-20 14:19:12,189 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18955#true} {18956#false} #69#return; {18956#false} is VALID [2022-02-20 14:19:12,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {18955#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(120, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(114, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1); {18955#true} is VALID [2022-02-20 14:19:12,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {18955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~ret11#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~post13#1, main_~i~2#1, main_#t~ret15#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~0#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~temp~0#1;havoc main_~ret~0#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 85: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 86: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 87: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,201 INFO L290 TraceCheckUtils]: 88: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 90: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 91: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 92: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 93: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 94: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,202 INFO L290 TraceCheckUtils]: 95: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 101: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,203 INFO L290 TraceCheckUtils]: 102: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 103: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 104: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 105: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 108: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,204 INFO L290 TraceCheckUtils]: 109: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 111: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 112: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 113: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 114: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 115: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 116: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,205 INFO L290 TraceCheckUtils]: 117: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 118: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 119: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 120: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 121: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 123: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 125: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 126: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 127: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 128: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 129: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 130: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,207 INFO L290 TraceCheckUtils]: 131: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 132: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 133: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 134: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 135: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 136: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 137: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 138: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,208 INFO L290 TraceCheckUtils]: 139: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 140: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 141: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 142: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 143: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 144: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 145: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,209 INFO L290 TraceCheckUtils]: 146: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 147: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 148: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 149: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 150: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 151: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 152: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,210 INFO L290 TraceCheckUtils]: 153: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 154: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 155: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 156: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 157: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 158: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 159: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 160: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,211 INFO L290 TraceCheckUtils]: 161: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 162: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 163: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 164: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 165: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 166: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 167: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,212 INFO L290 TraceCheckUtils]: 168: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 169: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 170: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 171: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 172: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 173: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 174: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,213 INFO L290 TraceCheckUtils]: 175: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 176: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 177: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 178: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 179: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 180: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 181: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 182: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,214 INFO L290 TraceCheckUtils]: 183: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 184: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 185: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 186: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 187: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 188: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 189: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,215 INFO L290 TraceCheckUtils]: 190: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 191: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 192: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 193: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 194: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 195: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 196: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 197: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,216 INFO L290 TraceCheckUtils]: 198: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,217 INFO L290 TraceCheckUtils]: 199: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,217 INFO L290 TraceCheckUtils]: 200: Hoare triple {18955#true} assume !!(main_~i~1#1 < 100);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {18955#true} is VALID [2022-02-20 14:19:12,217 INFO L290 TraceCheckUtils]: 201: Hoare triple {18955#true} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {18955#true} is VALID [2022-02-20 14:19:12,240 INFO L290 TraceCheckUtils]: 202: Hoare triple {18955#true} assume !(main_~i~1#1 < 100); {18955#true} is VALID [2022-02-20 14:19:12,240 INFO L272 TraceCheckUtils]: 203: Hoare triple {18955#true} call main_#t~ret8#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {18955#true} is VALID [2022-02-20 14:19:12,241 INFO L290 TraceCheckUtils]: 204: Hoare triple {18955#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {19164#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:12,241 INFO L290 TraceCheckUtils]: 205: Hoare triple {19164#(<= xor_~i~0 1)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19164#(<= xor_~i~0 1)} is VALID [2022-02-20 14:19:12,242 INFO L290 TraceCheckUtils]: 206: Hoare triple {19164#(<= xor_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19165#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:12,242 INFO L290 TraceCheckUtils]: 207: Hoare triple {19165#(<= xor_~i~0 2)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19165#(<= xor_~i~0 2)} is VALID [2022-02-20 14:19:12,243 INFO L290 TraceCheckUtils]: 208: Hoare triple {19165#(<= xor_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19166#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:12,243 INFO L290 TraceCheckUtils]: 209: Hoare triple {19166#(<= xor_~i~0 3)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19166#(<= xor_~i~0 3)} is VALID [2022-02-20 14:19:12,243 INFO L290 TraceCheckUtils]: 210: Hoare triple {19166#(<= xor_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19167#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:12,244 INFO L290 TraceCheckUtils]: 211: Hoare triple {19167#(<= xor_~i~0 4)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19167#(<= xor_~i~0 4)} is VALID [2022-02-20 14:19:12,244 INFO L290 TraceCheckUtils]: 212: Hoare triple {19167#(<= xor_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19168#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:12,245 INFO L290 TraceCheckUtils]: 213: Hoare triple {19168#(<= xor_~i~0 5)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19168#(<= xor_~i~0 5)} is VALID [2022-02-20 14:19:12,245 INFO L290 TraceCheckUtils]: 214: Hoare triple {19168#(<= xor_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19169#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:12,245 INFO L290 TraceCheckUtils]: 215: Hoare triple {19169#(<= xor_~i~0 6)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19169#(<= xor_~i~0 6)} is VALID [2022-02-20 14:19:12,246 INFO L290 TraceCheckUtils]: 216: Hoare triple {19169#(<= xor_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19170#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:12,246 INFO L290 TraceCheckUtils]: 217: Hoare triple {19170#(<= xor_~i~0 7)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19170#(<= xor_~i~0 7)} is VALID [2022-02-20 14:19:12,247 INFO L290 TraceCheckUtils]: 218: Hoare triple {19170#(<= xor_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19171#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:12,247 INFO L290 TraceCheckUtils]: 219: Hoare triple {19171#(<= xor_~i~0 8)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19171#(<= xor_~i~0 8)} is VALID [2022-02-20 14:19:12,247 INFO L290 TraceCheckUtils]: 220: Hoare triple {19171#(<= xor_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19172#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:12,248 INFO L290 TraceCheckUtils]: 221: Hoare triple {19172#(<= xor_~i~0 9)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19172#(<= xor_~i~0 9)} is VALID [2022-02-20 14:19:12,248 INFO L290 TraceCheckUtils]: 222: Hoare triple {19172#(<= xor_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19173#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:12,248 INFO L290 TraceCheckUtils]: 223: Hoare triple {19173#(<= xor_~i~0 10)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19173#(<= xor_~i~0 10)} is VALID [2022-02-20 14:19:12,249 INFO L290 TraceCheckUtils]: 224: Hoare triple {19173#(<= xor_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:12,249 INFO L290 TraceCheckUtils]: 225: Hoare triple {19174#(<= xor_~i~0 11)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19174#(<= xor_~i~0 11)} is VALID [2022-02-20 14:19:12,250 INFO L290 TraceCheckUtils]: 226: Hoare triple {19174#(<= xor_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19175#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:12,250 INFO L290 TraceCheckUtils]: 227: Hoare triple {19175#(<= xor_~i~0 12)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19175#(<= xor_~i~0 12)} is VALID [2022-02-20 14:19:12,250 INFO L290 TraceCheckUtils]: 228: Hoare triple {19175#(<= xor_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19176#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:12,251 INFO L290 TraceCheckUtils]: 229: Hoare triple {19176#(<= xor_~i~0 13)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19176#(<= xor_~i~0 13)} is VALID [2022-02-20 14:19:12,251 INFO L290 TraceCheckUtils]: 230: Hoare triple {19176#(<= xor_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19177#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:12,252 INFO L290 TraceCheckUtils]: 231: Hoare triple {19177#(<= xor_~i~0 14)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19177#(<= xor_~i~0 14)} is VALID [2022-02-20 14:19:12,252 INFO L290 TraceCheckUtils]: 232: Hoare triple {19177#(<= xor_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19178#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:12,252 INFO L290 TraceCheckUtils]: 233: Hoare triple {19178#(<= xor_~i~0 15)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19178#(<= xor_~i~0 15)} is VALID [2022-02-20 14:19:12,253 INFO L290 TraceCheckUtils]: 234: Hoare triple {19178#(<= xor_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19179#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:12,253 INFO L290 TraceCheckUtils]: 235: Hoare triple {19179#(<= xor_~i~0 16)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19179#(<= xor_~i~0 16)} is VALID [2022-02-20 14:19:12,254 INFO L290 TraceCheckUtils]: 236: Hoare triple {19179#(<= xor_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19180#(<= xor_~i~0 17)} is VALID [2022-02-20 14:19:12,254 INFO L290 TraceCheckUtils]: 237: Hoare triple {19180#(<= xor_~i~0 17)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19180#(<= xor_~i~0 17)} is VALID [2022-02-20 14:19:12,254 INFO L290 TraceCheckUtils]: 238: Hoare triple {19180#(<= xor_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19181#(<= xor_~i~0 18)} is VALID [2022-02-20 14:19:12,255 INFO L290 TraceCheckUtils]: 239: Hoare triple {19181#(<= xor_~i~0 18)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19181#(<= xor_~i~0 18)} is VALID [2022-02-20 14:19:12,255 INFO L290 TraceCheckUtils]: 240: Hoare triple {19181#(<= xor_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19182#(<= xor_~i~0 19)} is VALID [2022-02-20 14:19:12,255 INFO L290 TraceCheckUtils]: 241: Hoare triple {19182#(<= xor_~i~0 19)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19182#(<= xor_~i~0 19)} is VALID [2022-02-20 14:19:12,256 INFO L290 TraceCheckUtils]: 242: Hoare triple {19182#(<= xor_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19183#(<= xor_~i~0 20)} is VALID [2022-02-20 14:19:12,256 INFO L290 TraceCheckUtils]: 243: Hoare triple {19183#(<= xor_~i~0 20)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19183#(<= xor_~i~0 20)} is VALID [2022-02-20 14:19:12,257 INFO L290 TraceCheckUtils]: 244: Hoare triple {19183#(<= xor_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19184#(<= xor_~i~0 21)} is VALID [2022-02-20 14:19:12,257 INFO L290 TraceCheckUtils]: 245: Hoare triple {19184#(<= xor_~i~0 21)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19184#(<= xor_~i~0 21)} is VALID [2022-02-20 14:19:12,257 INFO L290 TraceCheckUtils]: 246: Hoare triple {19184#(<= xor_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19185#(<= xor_~i~0 22)} is VALID [2022-02-20 14:19:12,258 INFO L290 TraceCheckUtils]: 247: Hoare triple {19185#(<= xor_~i~0 22)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19185#(<= xor_~i~0 22)} is VALID [2022-02-20 14:19:12,258 INFO L290 TraceCheckUtils]: 248: Hoare triple {19185#(<= xor_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19186#(<= xor_~i~0 23)} is VALID [2022-02-20 14:19:12,259 INFO L290 TraceCheckUtils]: 249: Hoare triple {19186#(<= xor_~i~0 23)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19186#(<= xor_~i~0 23)} is VALID [2022-02-20 14:19:12,259 INFO L290 TraceCheckUtils]: 250: Hoare triple {19186#(<= xor_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19187#(<= xor_~i~0 24)} is VALID [2022-02-20 14:19:12,259 INFO L290 TraceCheckUtils]: 251: Hoare triple {19187#(<= xor_~i~0 24)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19187#(<= xor_~i~0 24)} is VALID [2022-02-20 14:19:12,260 INFO L290 TraceCheckUtils]: 252: Hoare triple {19187#(<= xor_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19188#(<= xor_~i~0 25)} is VALID [2022-02-20 14:19:12,260 INFO L290 TraceCheckUtils]: 253: Hoare triple {19188#(<= xor_~i~0 25)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19188#(<= xor_~i~0 25)} is VALID [2022-02-20 14:19:12,261 INFO L290 TraceCheckUtils]: 254: Hoare triple {19188#(<= xor_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19189#(<= xor_~i~0 26)} is VALID [2022-02-20 14:19:12,261 INFO L290 TraceCheckUtils]: 255: Hoare triple {19189#(<= xor_~i~0 26)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19189#(<= xor_~i~0 26)} is VALID [2022-02-20 14:19:12,261 INFO L290 TraceCheckUtils]: 256: Hoare triple {19189#(<= xor_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19190#(<= xor_~i~0 27)} is VALID [2022-02-20 14:19:12,262 INFO L290 TraceCheckUtils]: 257: Hoare triple {19190#(<= xor_~i~0 27)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19190#(<= xor_~i~0 27)} is VALID [2022-02-20 14:19:12,262 INFO L290 TraceCheckUtils]: 258: Hoare triple {19190#(<= xor_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19191#(<= xor_~i~0 28)} is VALID [2022-02-20 14:19:12,262 INFO L290 TraceCheckUtils]: 259: Hoare triple {19191#(<= xor_~i~0 28)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19191#(<= xor_~i~0 28)} is VALID [2022-02-20 14:19:12,263 INFO L290 TraceCheckUtils]: 260: Hoare triple {19191#(<= xor_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19192#(<= xor_~i~0 29)} is VALID [2022-02-20 14:19:12,263 INFO L290 TraceCheckUtils]: 261: Hoare triple {19192#(<= xor_~i~0 29)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19192#(<= xor_~i~0 29)} is VALID [2022-02-20 14:19:12,264 INFO L290 TraceCheckUtils]: 262: Hoare triple {19192#(<= xor_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19193#(<= xor_~i~0 30)} is VALID [2022-02-20 14:19:12,264 INFO L290 TraceCheckUtils]: 263: Hoare triple {19193#(<= xor_~i~0 30)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19193#(<= xor_~i~0 30)} is VALID [2022-02-20 14:19:12,265 INFO L290 TraceCheckUtils]: 264: Hoare triple {19193#(<= xor_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19194#(<= xor_~i~0 31)} is VALID [2022-02-20 14:19:12,265 INFO L290 TraceCheckUtils]: 265: Hoare triple {19194#(<= xor_~i~0 31)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19194#(<= xor_~i~0 31)} is VALID [2022-02-20 14:19:12,265 INFO L290 TraceCheckUtils]: 266: Hoare triple {19194#(<= xor_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19195#(<= xor_~i~0 32)} is VALID [2022-02-20 14:19:12,266 INFO L290 TraceCheckUtils]: 267: Hoare triple {19195#(<= xor_~i~0 32)} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {19195#(<= xor_~i~0 32)} is VALID [2022-02-20 14:19:12,266 INFO L290 TraceCheckUtils]: 268: Hoare triple {19195#(<= xor_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19196#(<= xor_~i~0 33)} is VALID [2022-02-20 14:19:12,266 INFO L290 TraceCheckUtils]: 269: Hoare triple {19196#(<= xor_~i~0 33)} assume !(~i~0 < 100); {18956#false} is VALID [2022-02-20 14:19:12,267 INFO L290 TraceCheckUtils]: 270: Hoare triple {18956#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18956#false} is VALID [2022-02-20 14:19:12,267 INFO L290 TraceCheckUtils]: 271: Hoare triple {18956#false} assume true; {18956#false} is VALID [2022-02-20 14:19:12,267 INFO L284 TraceCheckUtils]: 272: Hoare quadruple {18956#false} {18955#true} #65#return; {18956#false} is VALID [2022-02-20 14:19:12,267 INFO L290 TraceCheckUtils]: 273: Hoare triple {18956#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~ret~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4); {18956#false} is VALID [2022-02-20 14:19:12,267 INFO L272 TraceCheckUtils]: 274: Hoare triple {18956#false} call main_#t~ret11#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {18955#true} is VALID [2022-02-20 14:19:12,267 INFO L290 TraceCheckUtils]: 275: Hoare triple {18955#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {18955#true} is VALID [2022-02-20 14:19:12,267 INFO L290 TraceCheckUtils]: 276: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 277: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 278: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 279: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 280: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 281: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 282: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,268 INFO L290 TraceCheckUtils]: 283: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 284: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 285: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 286: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 287: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 288: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 289: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,269 INFO L290 TraceCheckUtils]: 290: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 291: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 292: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 293: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 294: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 295: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 296: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,270 INFO L290 TraceCheckUtils]: 297: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 298: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 299: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 300: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 301: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 302: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 303: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,271 INFO L290 TraceCheckUtils]: 304: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 305: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 306: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 307: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 308: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 309: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 310: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 311: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,272 INFO L290 TraceCheckUtils]: 312: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 313: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 314: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 315: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 316: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 317: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 318: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,273 INFO L290 TraceCheckUtils]: 319: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 320: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 321: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 322: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 323: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 324: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 325: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,274 INFO L290 TraceCheckUtils]: 326: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 327: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 328: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 329: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 330: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 331: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 332: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,275 INFO L290 TraceCheckUtils]: 333: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 334: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 335: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 336: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 337: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 338: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 339: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 340: Hoare triple {18955#true} assume !(~i~0 < 100); {18955#true} is VALID [2022-02-20 14:19:12,276 INFO L290 TraceCheckUtils]: 341: Hoare triple {18955#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18955#true} is VALID [2022-02-20 14:19:12,277 INFO L290 TraceCheckUtils]: 342: Hoare triple {18955#true} assume true; {18955#true} is VALID [2022-02-20 14:19:12,277 INFO L284 TraceCheckUtils]: 343: Hoare quadruple {18955#true} {18956#false} #67#return; {18956#false} is VALID [2022-02-20 14:19:12,277 INFO L290 TraceCheckUtils]: 344: Hoare triple {18956#false} assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~ret2~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem12#1;havoc main_#t~mem12#1;main_~i~2#1 := 0; {18956#false} is VALID [2022-02-20 14:19:12,277 INFO L290 TraceCheckUtils]: 345: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,277 INFO L290 TraceCheckUtils]: 346: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,277 INFO L290 TraceCheckUtils]: 347: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,277 INFO L290 TraceCheckUtils]: 348: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 349: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 350: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 351: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 352: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 353: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 354: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 355: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,278 INFO L290 TraceCheckUtils]: 356: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 357: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 358: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 359: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 360: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 361: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 362: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,279 INFO L290 TraceCheckUtils]: 363: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 364: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 365: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 366: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 367: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 368: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 369: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 370: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,280 INFO L290 TraceCheckUtils]: 371: Hoare triple {18956#false} assume !!(main_~i~2#1 < 99);call main_#t~mem14#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem14#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem14#1; {18956#false} is VALID [2022-02-20 14:19:12,281 INFO L290 TraceCheckUtils]: 372: Hoare triple {18956#false} main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {18956#false} is VALID [2022-02-20 14:19:12,281 INFO L290 TraceCheckUtils]: 373: Hoare triple {18956#false} assume !(main_~i~2#1 < 99); {18956#false} is VALID [2022-02-20 14:19:12,281 INFO L290 TraceCheckUtils]: 374: Hoare triple {18956#false} call write~int(main_~temp~0#1, main_~#x~0#1.base, 396 + main_~#x~0#1.offset, 4); {18956#false} is VALID [2022-02-20 14:19:12,281 INFO L272 TraceCheckUtils]: 375: Hoare triple {18956#false} call main_#t~ret15#1 := xor(main_~#x~0#1.base, main_~#x~0#1.offset); {18955#true} is VALID [2022-02-20 14:19:12,281 INFO L290 TraceCheckUtils]: 376: Hoare triple {18955#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem1 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem1;havoc #t~mem1;~i~0 := 1; {18955#true} is VALID [2022-02-20 14:19:12,281 INFO L290 TraceCheckUtils]: 377: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,281 INFO L290 TraceCheckUtils]: 378: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 379: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 380: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 381: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 382: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 383: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 384: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 385: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,282 INFO L290 TraceCheckUtils]: 386: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 387: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 388: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 389: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 390: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 391: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 392: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,283 INFO L290 TraceCheckUtils]: 393: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 394: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 395: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 396: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 397: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 398: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 399: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 400: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,284 INFO L290 TraceCheckUtils]: 401: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 402: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 403: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 404: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 405: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 406: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 407: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,285 INFO L290 TraceCheckUtils]: 408: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 409: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 410: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 411: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 412: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 413: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 414: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 415: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,286 INFO L290 TraceCheckUtils]: 416: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 417: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 418: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 419: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 420: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 421: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 422: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,287 INFO L290 TraceCheckUtils]: 423: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 424: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 425: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 426: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 427: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 428: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 429: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 430: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,288 INFO L290 TraceCheckUtils]: 431: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 432: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 433: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 434: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 435: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 436: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 437: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,289 INFO L290 TraceCheckUtils]: 438: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 439: Hoare triple {18955#true} assume !!(~i~0 < 100);call #t~mem5 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := (if (1 == ~res~0 || 0 == ~res~0) && (1 == #t~mem5 || 0 == #t~mem5) then (if ~res~0 == #t~mem5 then 0 else 1) else (if 0 == ~res~0 then #t~mem5 else (if 0 == #t~mem5 then ~res~0 else ~bitwiseXOr(~res~0, #t~mem5))));havoc #t~mem5; {18955#true} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 440: Hoare triple {18955#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#true} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 441: Hoare triple {18955#true} assume !(~i~0 < 100); {18955#true} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 442: Hoare triple {18955#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {18955#true} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 443: Hoare triple {18955#true} assume true; {18955#true} is VALID [2022-02-20 14:19:12,290 INFO L284 TraceCheckUtils]: 444: Hoare quadruple {18955#true} {18956#false} #69#return; {18956#false} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 445: Hoare triple {18956#false} assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~ret5~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {18956#false} is VALID [2022-02-20 14:19:12,290 INFO L290 TraceCheckUtils]: 446: Hoare triple {18956#false} assume main_~ret~0#1 != main_~ret2~0#1 || main_~ret~0#1 != main_~ret5~0#1; {18956#false} is VALID [2022-02-20 14:19:12,291 INFO L290 TraceCheckUtils]: 447: Hoare triple {18956#false} assume !false; {18956#false} is VALID [2022-02-20 14:19:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 19619 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 14363 trivial. 0 not checked. [2022-02-20 14:19:12,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:12,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435287327] [2022-02-20 14:19:12,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435287327] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:19:12,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411489822] [2022-02-20 14:19:12,293 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:19:12,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:12,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:19:12,296 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:19:12,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process