/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:40:47,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:40:47,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:40:47,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:40:47,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:40:47,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:40:47,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:40:47,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:40:47,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:40:47,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:40:47,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:40:47,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:40:47,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:40:47,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:40:47,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:40:47,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:40:47,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:40:47,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:40:47,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:40:47,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:40:47,390 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:40:47,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:40:47,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:40:47,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:40:47,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:40:47,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:40:47,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:40:47,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:40:47,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:40:47,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:40:47,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:40:47,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:40:47,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:40:47,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:40:47,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:40:47,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:40:47,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:40:47,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:40:47,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:40:47,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:40:47,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:40:47,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:40:47,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:40:47,442 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:40:47,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:40:47,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:40:47,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:40:47,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:40:47,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:40:47,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:40:47,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:40:47,444 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:40:47,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:40:47,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:40:47,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:40:47,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:40:47,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:40:47,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:40:47,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:40:47,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:40:47,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:40:47,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:40:47,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:40:47,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:40:47,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:40:47,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:40:47,448 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:40:47,448 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:40:47,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:40:47,448 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:40:47,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:40:47,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:40:47,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:40:47,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:40:47,680 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:40:47,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2022-04-27 10:40:47,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1ec9c4a/10c790f66227436f8dfe515fa3dfc4c5/FLAG9a58d9b9d [2022-04-27 10:40:48,040 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:40:48,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2022-04-27 10:40:48,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1ec9c4a/10c790f66227436f8dfe515fa3dfc4c5/FLAG9a58d9b9d [2022-04-27 10:40:48,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1ec9c4a/10c790f66227436f8dfe515fa3dfc4c5 [2022-04-27 10:40:48,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:40:48,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:40:48,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:40:48,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:40:48,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:40:48,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf310a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48, skipping insertion in model container [2022-04-27 10:40:48,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:40:48,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:40:48,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i[919,932] [2022-04-27 10:40:48,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:40:48,678 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:40:48,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i[919,932] [2022-04-27 10:40:48,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:40:48,725 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:40:48,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48 WrapperNode [2022-04-27 10:40:48,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:40:48,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:40:48,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:40:48,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:40:48,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:40:48,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:40:48,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:40:48,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:40:48,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (1/1) ... [2022-04-27 10:40:48,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:40:48,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:40:48,796 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-04-27 10:40:48,823 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-04-27 10:40:48,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:40:48,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:40:48,837 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:40:48,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:40:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:40:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:40:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:40:48,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:40:48,921 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:40:48,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:40:49,042 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:40:49,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:40:49,048 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:40:49,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:40:49 BoogieIcfgContainer [2022-04-27 10:40:49,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:40:49,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:40:49,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:40:49,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:40:49,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:40:48" (1/3) ... [2022-04-27 10:40:49,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed7a33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:40:49, skipping insertion in model container [2022-04-27 10:40:49,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:40:48" (2/3) ... [2022-04-27 10:40:49,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed7a33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:40:49, skipping insertion in model container [2022-04-27 10:40:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:40:49" (3/3) ... [2022-04-27 10:40:49,071 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2022-04-27 10:40:49,082 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:40:49,082 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:40:49,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:40:49,126 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29a75fe1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48ae559d [2022-04-27 10:40:49,126 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:40:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:40:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:40:49,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:40:49,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:40:49,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:40:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:40:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1210672905, now seen corresponding path program 1 times [2022-04-27 10:40:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:40:49,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510015626] [2022-04-27 10:40:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:40:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:40:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:40:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:49,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {33#true} is VALID [2022-04-27 10:40:49,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 10:40:49,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #70#return; {33#true} is VALID [2022-04-27 10:40:49,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:40:49,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {33#true} is VALID [2022-04-27 10:40:49,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 10:40:49,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #70#return; {33#true} is VALID [2022-04-27 10:40:49,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2022-04-27 10:40:49,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {38#(= main_~index~0 0)} is VALID [2022-04-27 10:40:49,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {34#false} is VALID [2022-04-27 10:40:49,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} ~index~0 := 0; {34#false} is VALID [2022-04-27 10:40:49,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {34#false} is VALID [2022-04-27 10:40:49,457 INFO L272 TraceCheckUtils]: 9: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-27 10:40:49,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 10:40:49,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 10:40:49,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 10:40:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:40:49,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:40:49,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510015626] [2022-04-27 10:40:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510015626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:40:49,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:40:49,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:40:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002311013] [2022-04-27 10:40:49,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:40:49,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:40:49,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:40:49,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:40:49,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:40:49,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:40:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:40:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:40:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:40:49,535 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:40:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:40:49,759 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-27 10:40:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:40:49,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:40:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:40:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:40:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-27 10:40:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:40:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-27 10:40:49,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-04-27 10:40:49,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:40:49,863 INFO L225 Difference]: With dead ends: 62 [2022-04-27 10:40:49,863 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:40:49,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:40:49,868 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:40:49,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:40:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:40:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-04-27 10:40:49,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:40:49,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:40:49,895 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:40:49,896 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:40:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:40:49,899 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:40:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:40:49,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:40:49,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:40:49,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 10:40:49,901 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 10:40:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:40:49,904 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:40:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:40:49,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:40:49,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:40:49,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:40:49,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:40:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:40:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-27 10:40:49,908 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2022-04-27 10:40:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:40:49,908 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-27 10:40:49,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:40:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 10:40:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:40:49,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:40:49,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:40:49,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:40:49,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:40:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:40:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 778735204, now seen corresponding path program 1 times [2022-04-27 10:40:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:40:49,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669358613] [2022-04-27 10:40:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:40:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:40:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:40:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:50,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {229#true} is VALID [2022-04-27 10:40:50,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-27 10:40:50,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {229#true} {229#true} #70#return; {229#true} is VALID [2022-04-27 10:40:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:40:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:50,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-27 10:40:50,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-27 10:40:50,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-27 10:40:50,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {234#(= main_~index~0 0)} #66#return; {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:50,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:40:50,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {229#true} is VALID [2022-04-27 10:40:50,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-27 10:40:50,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #70#return; {229#true} is VALID [2022-04-27 10:40:50,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-27 10:40:50,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:50,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:50,034 INFO L272 TraceCheckUtils]: 7: Hoare triple {234#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {229#true} is VALID [2022-04-27 10:40:50,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-27 10:40:50,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-27 10:40:50,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-27 10:40:50,035 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {229#true} {234#(= main_~index~0 0)} #66#return; {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:50,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:50,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {239#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:40:50,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {230#false} is VALID [2022-04-27 10:40:50,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {230#false} ~index~0 := 0; {230#false} is VALID [2022-04-27 10:40:50,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {230#false} is VALID [2022-04-27 10:40:50,037 INFO L272 TraceCheckUtils]: 17: Hoare triple {230#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {230#false} is VALID [2022-04-27 10:40:50,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {230#false} ~cond := #in~cond; {230#false} is VALID [2022-04-27 10:40:50,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {230#false} assume 0 == ~cond; {230#false} is VALID [2022-04-27 10:40:50,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-27 10:40:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:40:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:40:50,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669358613] [2022-04-27 10:40:50,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669358613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:40:50,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659362062] [2022-04-27 10:40:50,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:40:50,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:40:50,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:40:50,041 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-04-27 10:40:50,046 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-04-27 10:40:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:50,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:40:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:50,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:40:50,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-27 10:40:50,703 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-27 10:40:50,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-04-27 10:40:51,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-27 10:40:51,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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(29, 2); {229#true} is VALID [2022-04-27 10:40:51,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-27 10:40:51,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #70#return; {229#true} is VALID [2022-04-27 10:40:51,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-27 10:40:51,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:51,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {234#(= main_~index~0 0)} is VALID [2022-04-27 10:40:51,568 INFO L272 TraceCheckUtils]: 7: Hoare triple {234#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {229#true} is VALID [2022-04-27 10:40:51,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} ~cond := #in~cond; {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 10:40:51,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:40:51,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:40:51,570 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {272#(not (= |assume_abort_if_not_#in~cond| 0))} {234#(= main_~index~0 0)} #66#return; {279#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} is VALID [2022-04-27 10:40:51,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {279#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:51,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:51,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} assume !(~index~0 % 4294967296 < 10000); {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:51,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} ~index~0 := 0; {293#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-27 10:40:51,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {297#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-27 10:40:51,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {297#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:40:51,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:40:51,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-27 10:40:51,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-27 10:40:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:40:51,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:40:51,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-27 10:40:51,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:40:51,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-04-27 10:40:51,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-04-27 10:40:51,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:40:51,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-27 10:40:51,853 INFO L356 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-04-27 10:40:51,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 50 [2022-04-27 10:40:53,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-27 10:40:53,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-27 10:40:53,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:40:53,907 INFO L272 TraceCheckUtils]: 17: Hoare triple {321#(< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:40:53,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(or (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {321#(< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296))} is VALID [2022-04-27 10:40:53,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} ~index~0 := 0; {325#(or (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:40:53,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} assume !(~index~0 % 4294967296 < 10000); {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:53,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:53,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {338#(and (<= (div (+ (- 1) (* (- 1) main_~tmp~0)) (- 4294967296)) (+ 2 (div (+ main_~tmp~0 (- 4294967297)) 4294967296))) (= (* (mod main_~index~0 4294967296) 4) 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:53,914 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {272#(not (= |assume_abort_if_not_#in~cond| 0))} {342#(or (<= 4294967295 (mod main_~index~0 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} #66#return; {338#(and (<= (div (+ (- 1) (* (- 1) main_~tmp~0)) (- 4294967296)) (+ 2 (div (+ main_~tmp~0 (- 4294967297)) 4294967296))) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-27 10:40:53,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:40:53,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {352#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:40:53,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} ~cond := #in~cond; {352#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 10:40:53,916 INFO L272 TraceCheckUtils]: 7: Hoare triple {342#(or (<= 4294967295 (mod main_~index~0 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {229#true} is VALID [2022-04-27 10:40:53,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {359#(or (<= 10000 (mod main_~index~0 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {342#(or (<= 4294967295 (mod main_~index~0 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-27 10:40:53,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {359#(or (<= 10000 (mod main_~index~0 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-27 10:40:53,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-27 10:40:53,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #70#return; {229#true} is VALID [2022-04-27 10:40:53,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-27 10:40:53,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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(29, 2); {229#true} is VALID [2022-04-27 10:40:53,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-27 10:40:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:40:53,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659362062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:40:53,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:40:53,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 12] total 19 [2022-04-27 10:40:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921879458] [2022-04-27 10:40:53,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:40:53,921 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2022-04-27 10:40:53,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:40:53,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:40:53,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:40:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:40:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:40:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:40:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:40:53,972 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:40:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:40:54,837 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-27 10:40:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:40:54,838 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2022-04-27 10:40:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:40:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:40:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 10:40:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:40:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 10:40:54,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 10:40:54,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:40:54,892 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:40:54,892 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 10:40:54,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:40:54,895 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:40:54,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 64 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:40:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 10:40:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-04-27 10:40:54,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:40:54,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:40:54,915 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:40:54,916 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:40:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:40:54,923 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 10:40:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 10:40:54,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:40:54,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:40:54,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 10:40:54,924 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 10:40:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:40:54,927 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 10:40:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 10:40:54,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:40:54,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:40:54,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:40:54,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:40:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:40:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 10:40:54,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2022-04-27 10:40:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:40:54,933 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 10:40:54,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:40:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 10:40:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:40:54,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:40:54,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:40:54,962 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-04-27 10:40:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:40:55,151 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:40:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:40:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1692936895, now seen corresponding path program 2 times [2022-04-27 10:40:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:40:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647274341] [2022-04-27 10:40:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:40:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:40:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:40:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:55,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {594#true} is VALID [2022-04-27 10:40:55,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:55,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {594#true} {594#true} #70#return; {594#true} is VALID [2022-04-27 10:40:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:40:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:55,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-04-27 10:40:55,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume !(0 == ~cond); {594#true} is VALID [2022-04-27 10:40:55,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:55,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {594#true} {599#(= main_~index~0 0)} #66#return; {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:55,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:40:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:55,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-04-27 10:40:55,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume !(0 == ~cond); {594#true} is VALID [2022-04-27 10:40:55,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:55,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {594#true} {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:40:55,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:40:55,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {594#true} is VALID [2022-04-27 10:40:55,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:55,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} #70#return; {594#true} is VALID [2022-04-27 10:40:55,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {594#true} call #t~ret5 := main(); {594#true} is VALID [2022-04-27 10:40:55,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:55,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {599#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:55,262 INFO L272 TraceCheckUtils]: 7: Hoare triple {599#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {594#true} is VALID [2022-04-27 10:40:55,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-04-27 10:40:55,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#true} assume !(0 == ~cond); {594#true} is VALID [2022-04-27 10:40:55,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:55,263 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {594#true} {599#(= main_~index~0 0)} #66#return; {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:55,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:55,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:40:55,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:40:55,264 INFO L272 TraceCheckUtils]: 15: Hoare triple {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {594#true} is VALID [2022-04-27 10:40:55,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-04-27 10:40:55,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#true} assume !(0 == ~cond); {594#true} is VALID [2022-04-27 10:40:55,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:55,265 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {594#true} {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:40:55,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:40:55,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {604#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {609#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:40:55,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {609#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {595#false} is VALID [2022-04-27 10:40:55,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {595#false} ~index~0 := 0; {595#false} is VALID [2022-04-27 10:40:55,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {595#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {595#false} is VALID [2022-04-27 10:40:55,268 INFO L272 TraceCheckUtils]: 25: Hoare triple {595#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {595#false} is VALID [2022-04-27 10:40:55,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2022-04-27 10:40:55,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {595#false} assume 0 == ~cond; {595#false} is VALID [2022-04-27 10:40:55,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {595#false} assume !false; {595#false} is VALID [2022-04-27 10:40:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:40:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:40:55,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647274341] [2022-04-27 10:40:55,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647274341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:40:55,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528423173] [2022-04-27 10:40:55,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:40:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:40:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:40:55,270 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-04-27 10:40:55,287 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-04-27 10:40:55,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:40:55,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:40:55,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 10:40:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:40:55,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:40:55,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-27 10:40:56,653 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-04-27 10:40:56,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-04-27 10:40:57,862 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-27 10:40:57,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-04-27 10:40:58,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2022-04-27 10:40:58,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#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(29, 2); {594#true} is VALID [2022-04-27 10:40:58,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2022-04-27 10:40:58,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} #70#return; {594#true} is VALID [2022-04-27 10:40:58,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {594#true} call #t~ret5 := main(); {594#true} is VALID [2022-04-27 10:40:58,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:58,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {599#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {599#(= main_~index~0 0)} is VALID [2022-04-27 10:40:58,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {599#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {594#true} is VALID [2022-04-27 10:40:58,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} ~cond := #in~cond; {638#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 10:40:58,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {642#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:40:58,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {642#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:40:58,442 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {642#(not (= |assume_abort_if_not_#in~cond| 0))} {599#(= main_~index~0 0)} #66#return; {649#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} is VALID [2022-04-27 10:40:58,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:58,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:58,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {660#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-27 10:40:58,446 INFO L272 TraceCheckUtils]: 15: Hoare triple {660#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (< (mod main_~index~0 4294967296) 10000))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {664#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1)))} is VALID [2022-04-27 10:40:58,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1)))} ~cond := #in~cond; {668#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1))))} is VALID [2022-04-27 10:40:58,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1))))} assume !(0 == ~cond); {672#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1))))} is VALID [2022-04-27 10:40:58,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {672#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1))))} assume true; {672#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1))))} is VALID [2022-04-27 10:40:58,459 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {672#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< (div (+ (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967295) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|)) 4294967296) 1))))} {660#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (< (mod main_~index~0 4294967296) 10000))} #66#return; {679#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-27 10:40:58,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {679#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (< (mod main_~index~0 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:58,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:58,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} assume !(~index~0 % 4294967296 < 10000); {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-27 10:40:58,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} ~index~0 := 0; {692#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-27 10:40:58,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {692#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {696#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-27 10:40:58,468 INFO L272 TraceCheckUtils]: 25: Hoare triple {696#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:40:58,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:40:58,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {595#false} is VALID [2022-04-27 10:40:58,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {595#false} assume !false; {595#false} is VALID [2022-04-27 10:40:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:40:58,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:41:02,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528423173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:41:02,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:41:02,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 19 [2022-04-27 10:41:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595871137] [2022-04-27 10:41:02,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:41:02,806 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-04-27 10:41:02,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:41:02,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:41:02,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:41:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:41:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:41:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:41:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=428, Unknown=2, NotChecked=0, Total=506 [2022-04-27 10:41:02,861 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:41:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:04,008 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-04-27 10:41:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 10:41:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-04-27 10:41:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:41:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:41:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2022-04-27 10:41:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:41:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2022-04-27 10:41:04,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 73 transitions. [2022-04-27 10:41:04,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:41:04,085 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:41:04,086 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 10:41:04,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=260, Invalid=1460, Unknown=2, NotChecked=0, Total=1722 [2022-04-27 10:41:04,088 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:41:04,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 66 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 270 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2022-04-27 10:41:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 10:41:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2022-04-27 10:41:04,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:41:04,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:41:04,120 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:41:04,120 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:41:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:04,123 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-27 10:41:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-27 10:41:04,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:41:04,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:41:04,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 55 states. [2022-04-27 10:41:04,125 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 55 states. [2022-04-27 10:41:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:04,128 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-27 10:41:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-27 10:41:04,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:41:04,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:41:04,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:41:04,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:41:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:41:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-27 10:41:04,131 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 29 [2022-04-27 10:41:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:41:04,131 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-27 10:41:04,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 6 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:41:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-27 10:41:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 10:41:04,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:41:04,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:41:04,149 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-04-27 10:41:04,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:41:04,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:41:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:41:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1452373648, now seen corresponding path program 1 times [2022-04-27 10:41:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:41:04,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563376206] [2022-04-27 10:41:04,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:41:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:41:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:41:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {1052#true} is VALID [2022-04-27 10:41:04,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1052#true} {1052#true} #70#return; {1052#true} is VALID [2022-04-27 10:41:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:41:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1057#(= main_~index~0 0)} #66#return; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:41:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:41:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:41:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1053#false} #68#return; {1053#false} is VALID [2022-04-27 10:41:04,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1052#true} call ULTIMATE.init(); {1077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:41:04,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {1052#true} is VALID [2022-04-27 10:41:04,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} #70#return; {1052#true} is VALID [2022-04-27 10:41:04,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {1052#true} call #t~ret5 := main(); {1052#true} is VALID [2022-04-27 10:41:04,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:04,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {1057#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:04,520 INFO L272 TraceCheckUtils]: 7: Hoare triple {1057#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1052#true} is VALID [2022-04-27 10:41:04,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,521 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1052#true} {1057#(= main_~index~0 0)} #66#return; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:04,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {1057#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:04,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:04,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:04,522 INFO L272 TraceCheckUtils]: 15: Hoare triple {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1052#true} is VALID [2022-04-27 10:41:04,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,523 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1052#true} {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:04,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:04,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:04,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:04,525 INFO L272 TraceCheckUtils]: 23: Hoare triple {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1052#true} is VALID [2022-04-27 10:41:04,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,526 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1052#true} {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:04,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:04,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1072#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:41:04,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {1053#false} is VALID [2022-04-27 10:41:04,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {1053#false} ~index~0 := 0; {1053#false} is VALID [2022-04-27 10:41:04,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {1053#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1053#false} is VALID [2022-04-27 10:41:04,528 INFO L272 TraceCheckUtils]: 33: Hoare triple {1053#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1052#true} is VALID [2022-04-27 10:41:04,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:04,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:04,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:04,529 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1052#true} {1053#false} #68#return; {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {1053#false} havoc #t~mem4; {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {1053#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {1053#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L272 TraceCheckUtils]: 41: Hoare triple {1053#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {1053#false} ~cond := #in~cond; {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {1053#false} assume 0 == ~cond; {1053#false} is VALID [2022-04-27 10:41:04,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2022-04-27 10:41:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 10:41:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:41:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563376206] [2022-04-27 10:41:04,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563376206] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:41:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430692297] [2022-04-27 10:41:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:41:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:41:04,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:41:04,536 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-04-27 10:41:04,565 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-04-27 10:41:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 10:41:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:04,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:41:05,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-04-27 10:41:11,007 INFO L356 Elim1Store]: treesize reduction 39, result has 39.1 percent of original size [2022-04-27 10:41:11,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2022-04-27 10:41:27,515 INFO L356 Elim1Store]: treesize reduction 41, result has 40.6 percent of original size [2022-04-27 10:41:27,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 59 [2022-04-27 10:41:28,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {1052#true} call ULTIMATE.init(); {1052#true} is VALID [2022-04-27 10:41:28,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#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(29, 2); {1052#true} is VALID [2022-04-27 10:41:28,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:28,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} #70#return; {1052#true} is VALID [2022-04-27 10:41:28,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {1052#true} call #t~ret5 := main(); {1052#true} is VALID [2022-04-27 10:41:28,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:28,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {1057#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:28,427 INFO L272 TraceCheckUtils]: 7: Hoare triple {1057#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1052#true} is VALID [2022-04-27 10:41:28,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-04-27 10:41:28,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-04-27 10:41:28,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-04-27 10:41:28,428 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1052#true} {1057#(= main_~index~0 0)} #66#return; {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:28,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {1057#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1057#(= main_~index~0 0)} is VALID [2022-04-27 10:41:28,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:28,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:28,430 INFO L272 TraceCheckUtils]: 15: Hoare triple {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1052#true} is VALID [2022-04-27 10:41:28,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} ~cond := #in~cond; {1129#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 10:41:28,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1133#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:41:28,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {1133#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1133#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:41:28,431 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1133#(not (= |assume_abort_if_not_#in~cond| 0))} {1062#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {1140#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:28,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1140#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:41:28,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:41:28,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1151#(and (< (mod main_~index~0 4294967296) 10000) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))))} is VALID [2022-04-27 10:41:28,556 INFO L272 TraceCheckUtils]: 23: Hoare triple {1151#(and (< (mod main_~index~0 4294967296) 10000) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} is VALID [2022-04-27 10:41:28,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} ~cond := #in~cond; {1159#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-04-27 10:41:28,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {1159#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {1163#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))))} is VALID [2022-04-27 10:41:28,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {1163#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))))} assume true; {1163#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))))} is VALID [2022-04-27 10:41:28,589 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1163#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))))} {1151#(and (< (mod main_~index~0 4294967296) 10000) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))))} #66#return; {1170#(and (exists ((v_aux_mod_main_~index~0_30_1 Int) (v_aux_div_main_~tmp~0_28_1 Int) (v_aux_div_main_~index~0_30_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_30_1 4294967296) v_aux_mod_main_~index~0_30_1) 1) (<= 1 (+ (* v_aux_div_main_~index~0_30_1 4294967296) v_aux_mod_main_~index~0_30_1)) (< (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod v_aux_mod_main_~index~0_30_1 4294967296) 4) |main_~#array~0.offset|)) (+ (* 4294967296 v_aux_div_main_~tmp~0_28_1) 4294967296)) (< (+ (* 4294967296 v_aux_div_main_~tmp~0_28_1) v_aux_mod_main_~index~0_30_1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod v_aux_mod_main_~index~0_30_1 4294967296) 4) |main_~#array~0.offset|))) (<= 0 v_aux_mod_main_~index~0_30_1))) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-27 10:41:28,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {1170#(and (exists ((v_aux_mod_main_~index~0_30_1 Int) (v_aux_div_main_~tmp~0_28_1 Int) (v_aux_div_main_~index~0_30_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_30_1 4294967296) v_aux_mod_main_~index~0_30_1) 1) (<= 1 (+ (* v_aux_div_main_~index~0_30_1 4294967296) v_aux_mod_main_~index~0_30_1)) (< (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod v_aux_mod_main_~index~0_30_1 4294967296) 4) |main_~#array~0.offset|)) (+ (* 4294967296 v_aux_div_main_~tmp~0_28_1) 4294967296)) (< (+ (* 4294967296 v_aux_div_main_~tmp~0_28_1) v_aux_mod_main_~index~0_30_1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod v_aux_mod_main_~index~0_30_1 4294967296) 4) |main_~#array~0.offset|))) (<= 0 v_aux_mod_main_~index~0_30_1))) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (< (mod main_~index~0 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:41:28,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:41:28,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} assume !(~index~0 % 4294967296 < 10000); {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:41:28,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} ~index~0 := 0; {1183#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:41:28,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {1183#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1183#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:41:28,629 INFO L272 TraceCheckUtils]: 33: Hoare triple {1183#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} is VALID [2022-04-27 10:41:28,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} ~cond := #in~cond; {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} is VALID [2022-04-27 10:41:28,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} assume !(0 == ~cond); {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} is VALID [2022-04-27 10:41:28,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} assume true; {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} is VALID [2022-04-27 10:41:28,653 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1155#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30)))} {1183#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} #68#return; {1202#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:41:28,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {1202#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} havoc #t~mem4; {1202#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:41:28,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {1202#(and (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1209#(and (exists ((v_aux_mod_main_~index~0_30_2 Int) (v_aux_div_main_~index~0_30_2 Int) (v_aux_div_main_~tmp~0_28_2 Int)) (and (<= (+ (* v_aux_div_main_~index~0_30_2 4294967296) v_aux_mod_main_~index~0_30_2) 1) (< (+ (* 4294967296 v_aux_div_main_~tmp~0_28_2) v_aux_mod_main_~index~0_30_2) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_2 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_2 4294967296) 4))) (+ (* 4294967296 v_aux_div_main_~tmp~0_28_2) 4294967296)) (<= 1 (+ (* v_aux_div_main_~index~0_30_2 4294967296) v_aux_mod_main_~index~0_30_2)) (<= 0 v_aux_mod_main_~index~0_30_2))) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:41:28,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {1209#(and (exists ((v_aux_mod_main_~index~0_30_2 Int) (v_aux_div_main_~index~0_30_2 Int) (v_aux_div_main_~tmp~0_28_2 Int)) (and (<= (+ (* v_aux_div_main_~index~0_30_2 4294967296) v_aux_mod_main_~index~0_30_2) 1) (< (+ (* 4294967296 v_aux_div_main_~tmp~0_28_2) v_aux_mod_main_~index~0_30_2) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_2 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_2 4294967296) 4))) (+ (* 4294967296 v_aux_div_main_~tmp~0_28_2) 4294967296)) (<= 1 (+ (* v_aux_div_main_~index~0_30_2 4294967296) v_aux_mod_main_~index~0_30_2)) (<= 0 v_aux_mod_main_~index~0_30_2))) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (and (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 1 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 1) (<= 0 aux_mod_main_~index~0_30))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1213#(and (= main_~index~0 1) (< (+ (div (+ (- 2) |main_#t~mem4|) (- 4294967296)) (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296))) 1))} is VALID [2022-04-27 10:41:28,696 INFO L272 TraceCheckUtils]: 41: Hoare triple {1213#(and (= main_~index~0 1) (< (+ (div (+ (- 2) |main_#t~mem4|) (- 4294967296)) (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296))) 1))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:41:28,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {1217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:41:28,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {1221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1053#false} is VALID [2022-04-27 10:41:28,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2022-04-27 10:41:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:41:28,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:41:33,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430692297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:41:33,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:41:33,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 22 [2022-04-27 10:41:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529077350] [2022-04-27 10:41:33,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:41:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2022-04-27 10:41:33,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:41:33,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 10:41:38,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 10:41:38,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:41:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:41:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:41:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=640, Unknown=4, NotChecked=0, Total=756 [2022-04-27 10:41:38,876 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 10:41:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:39,699 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-27 10:41:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 10:41:39,699 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2022-04-27 10:41:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:41:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 10:41:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2022-04-27 10:41:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 10:41:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2022-04-27 10:41:39,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 72 transitions. [2022-04-27 10:41:42,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 71 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:41:42,233 INFO L225 Difference]: With dead ends: 77 [2022-04-27 10:41:42,233 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 10:41:42,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=203, Invalid=1275, Unknown=4, NotChecked=0, Total=1482 [2022-04-27 10:41:42,235 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:41:42,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2022-04-27 10:41:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 10:41:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 10:41:42,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:41:42,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:41:42,288 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:41:42,288 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:41:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:42,291 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 10:41:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 10:41:42,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:41:42,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:41:42,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-27 10:41:42,292 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-27 10:41:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:42,294 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 10:41:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 10:41:42,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:41:42,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:41:42,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:41:42,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:41:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:41:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-27 10:41:42,297 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2022-04-27 10:41:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:41:42,297 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-27 10:41:42,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 10:41:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 10:41:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 10:41:42,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:41:42,299 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:41:42,319 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-04-27 10:41:42,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:41:42,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:41:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:41:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 345870625, now seen corresponding path program 2 times [2022-04-27 10:41:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:41:42,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692827561] [2022-04-27 10:41:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:41:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:41:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:41:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {1657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {1623#true} is VALID [2022-04-27 10:41:42,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1623#true} {1623#true} #70#return; {1623#true} is VALID [2022-04-27 10:41:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:41:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1628#(= main_~index~0 0)} #66#return; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:41:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:41:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:41:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:42,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:41:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:41:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 10:41:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1624#false} #68#return; {1624#false} is VALID [2022-04-27 10:41:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 10:41:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1624#false} #68#return; {1624#false} is VALID [2022-04-27 10:41:42,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:41:42,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {1623#true} is VALID [2022-04-27 10:41:42,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #70#return; {1623#true} is VALID [2022-04-27 10:41:42,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret5 := main(); {1623#true} is VALID [2022-04-27 10:41:42,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:41:42,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:41:42,689 INFO L272 TraceCheckUtils]: 7: Hoare triple {1628#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:41:42,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,690 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1623#true} {1628#(= main_~index~0 0)} #66#return; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:41:42,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:41:42,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {1628#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:42,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:42,691 INFO L272 TraceCheckUtils]: 15: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:41:42,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,692 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1623#true} {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:42,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:41:42,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:42,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:42,693 INFO L272 TraceCheckUtils]: 23: Hoare triple {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:41:42,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,694 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1623#true} {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:42,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:41:42,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:41:42,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:41:42,696 INFO L272 TraceCheckUtils]: 31: Hoare triple {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:41:42,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,696 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1623#true} {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:41:42,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:41:42,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {1643#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1648#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-27 10:41:42,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {1648#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 10000); {1624#false} is VALID [2022-04-27 10:41:42,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {1624#false} ~index~0 := 0; {1624#false} is VALID [2022-04-27 10:41:42,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {1624#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1624#false} is VALID [2022-04-27 10:41:42,698 INFO L272 TraceCheckUtils]: 41: Hoare triple {1624#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,699 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1623#true} {1624#false} #68#return; {1624#false} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {1624#false} havoc #t~mem4; {1624#false} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {1624#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1624#false} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {1624#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1624#false} is VALID [2022-04-27 10:41:42,699 INFO L272 TraceCheckUtils]: 49: Hoare triple {1624#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:41:42,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:41:42,700 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1623#true} {1624#false} #68#return; {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {1624#false} havoc #t~mem4; {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 55: Hoare triple {1624#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {1624#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L272 TraceCheckUtils]: 57: Hoare triple {1624#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-27 10:41:42,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-27 10:41:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 10:41:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:41:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692827561] [2022-04-27 10:41:42,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692827561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:41:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140671889] [2022-04-27 10:41:42,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:41:42,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:41:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:41:42,702 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-04-27 10:41:42,736 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-04-27 10:41:42,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:41:42,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:41:42,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 10:41:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:42,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:41:43,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-04-27 10:41:50,323 INFO L356 Elim1Store]: treesize reduction 39, result has 39.1 percent of original size [2022-04-27 10:41:50,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2022-04-27 10:42:05,705 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-04-27 10:42:05,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 21 [2022-04-27 10:42:06,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1623#true} is VALID [2022-04-27 10:42:06,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#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(29, 2); {1623#true} is VALID [2022-04-27 10:42:06,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:42:06,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #70#return; {1623#true} is VALID [2022-04-27 10:42:06,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret5 := main(); {1623#true} is VALID [2022-04-27 10:42:06,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:42:06,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:42:06,348 INFO L272 TraceCheckUtils]: 7: Hoare triple {1628#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:42:06,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:42:06,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:42:06,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:42:06,356 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1623#true} {1628#(= main_~index~0 0)} #66#return; {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:42:06,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1628#(= main_~index~0 0)} is VALID [2022-04-27 10:42:06,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1628#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:06,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:06,357 INFO L272 TraceCheckUtils]: 15: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:42:06,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {1623#true} ~cond := #in~cond; {1623#true} is VALID [2022-04-27 10:42:06,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {1623#true} assume !(0 == ~cond); {1623#true} is VALID [2022-04-27 10:42:06,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 10:42:06,358 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1623#true} {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:06,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:06,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {1633#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:06,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:06,359 INFO L272 TraceCheckUtils]: 23: Hoare triple {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1623#true} is VALID [2022-04-27 10:42:06,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {1623#true} ~cond := #in~cond; {1733#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 10:42:06,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {1733#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1737#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:42:06,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {1737#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1737#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:42:06,365 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1737#(not (= |assume_abort_if_not_#in~cond| 0))} {1638#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {1744#(and (<= main_~index~0 2) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:06,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {1744#(and (<= main_~index~0 2) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:06,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:06,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {1755#(and (< (mod main_~index~0 4294967296) 10000) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))))} is VALID [2022-04-27 10:42:06,678 INFO L272 TraceCheckUtils]: 31: Hoare triple {1755#(and (< (mod main_~index~0 4294967296) 10000) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} is VALID [2022-04-27 10:42:06,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} ~cond := #in~cond; {1763#(and (exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-04-27 10:42:06,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {1763#(and (exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {1767#(and (exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))))) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-04-27 10:42:06,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#(and (exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))))) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {1767#(and (exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))))) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-04-27 10:42:06,708 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1767#(and (exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))))) (not (= |assume_abort_if_not_#in~cond| 0)))} {1755#(and (< (mod main_~index~0 4294967296) 10000) (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))))} #66#return; {1774#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (< (mod main_~index~0 4294967296) 10000) (exists ((v_aux_mod_main_~index~0_30_3 Int) (v_aux_div_main_~tmp~0_28_3 Int) (v_aux_div_main_~index~0_30_3 Int)) (and (<= 2 (+ (* v_aux_div_main_~index~0_30_3 4294967296) v_aux_mod_main_~index~0_30_3)) (<= (+ (* v_aux_div_main_~index~0_30_3 4294967296) v_aux_mod_main_~index~0_30_3) 2) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_3 4294967296) 4))) (+ (* 4294967296 v_aux_div_main_~tmp~0_28_3) 4294967296)) (< (+ (* 4294967296 v_aux_div_main_~tmp~0_28_3) v_aux_mod_main_~index~0_30_3) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_3 4294967296) 4)))) (<= 0 v_aux_mod_main_~index~0_30_3))))} is VALID [2022-04-27 10:42:06,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {1774#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (< (mod main_~index~0 4294967296) 10000) (exists ((v_aux_mod_main_~index~0_30_3 Int) (v_aux_div_main_~tmp~0_28_3 Int) (v_aux_div_main_~index~0_30_3 Int)) (and (<= 2 (+ (* v_aux_div_main_~index~0_30_3 4294967296) v_aux_mod_main_~index~0_30_3)) (<= (+ (* v_aux_div_main_~index~0_30_3 4294967296) v_aux_mod_main_~index~0_30_3) 2) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_3 4294967296) 4))) (+ (* 4294967296 v_aux_div_main_~tmp~0_28_3) 4294967296)) (< (+ (* 4294967296 v_aux_div_main_~tmp~0_28_3) v_aux_mod_main_~index~0_30_3) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod v_aux_mod_main_~index~0_30_3 4294967296) 4)))) (<= 0 v_aux_mod_main_~index~0_30_3))))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:06,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:06,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} assume !(~index~0 % 4294967296 < 10000); {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:06,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {1748#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} ~index~0 := 0; {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:42:06,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:42:06,728 INFO L272 TraceCheckUtils]: 41: Hoare triple {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:08,739 WARN L290 TraceCheckUtils]: 42: Hoare triple {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} ~cond := #in~cond; {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is UNKNOWN [2022-04-27 10:42:08,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} assume !(0 == ~cond); {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:08,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} assume true; {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} is VALID [2022-04-27 10:42:08,744 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1794#(exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (|v_main_~#array~0.offset_BEFORE_CALL_6| Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_6| Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_6|) (+ |v_main_~#array~0.offset_BEFORE_CALL_6| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296))))} {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} #68#return; {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:42:08,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} havoc #t~mem4; {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} is VALID [2022-04-27 10:42:08,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1813#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:42:08,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {1813#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1813#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:42:08,772 INFO L272 TraceCheckUtils]: 49: Hoare triple {1813#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} is VALID [2022-04-27 10:42:08,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} ~cond := #in~cond; {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} is VALID [2022-04-27 10:42:08,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} assume !(0 == ~cond); {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} is VALID [2022-04-27 10:42:09,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} assume true; {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} is VALID [2022-04-27 10:42:09,442 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1759#(exists ((aux_div_main_~index~0_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_5| Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int) (|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (and (<= 0 aux_mod_main_~index~0_30) (< (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) (+ |v_main_~#array~0.offset_BEFORE_CALL_5| (* (mod aux_mod_main_~index~0_30 4294967296) 4))))))} {1813#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 0))} #68#return; {1832#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 1))} is VALID [2022-04-27 10:42:09,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {1832#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 1))} havoc #t~mem4; {1832#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 1))} is VALID [2022-04-27 10:42:09,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {1832#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= main_~index~0 1))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1839#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 1))} is VALID [2022-04-27 10:42:09,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {1839#(and (exists ((aux_div_main_~index~0_30 Int) (aux_div_main_~tmp~0_28 Int) (aux_mod_main_~index~0_30 Int)) (and (<= 0 aux_mod_main_~index~0_30) (<= (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296)) 2) (<= 2 (+ aux_mod_main_~index~0_30 (* aux_div_main_~index~0_30 4294967296))) (< (+ (* 4294967296 aux_div_main_~tmp~0_28) aux_mod_main_~index~0_30) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4)))) (< (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod aux_mod_main_~index~0_30 4294967296) 4))) (+ (* 4294967296 aux_div_main_~tmp~0_28) 4294967296)))) (= (+ (- 1) main_~index~0) 1))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1843#(and (= 2 main_~index~0) (< (+ (div (+ (- 3) |main_#t~mem4|) (- 4294967296)) (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296))) 1))} is VALID [2022-04-27 10:42:09,449 INFO L272 TraceCheckUtils]: 57: Hoare triple {1843#(and (= 2 main_~index~0) (< (+ (div (+ (- 3) |main_#t~mem4|) (- 4294967296)) (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296))) 1))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:42:09,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {1847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:42:09,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {1851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1624#false} is VALID [2022-04-27 10:42:09,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-27 10:42:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:42:09,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:42:17,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140671889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:42:17,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:42:17,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22] total 25 [2022-04-27 10:42:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704485794] [2022-04-27 10:42:17,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:42:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-04-27 10:42:17,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:42:17,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:42:18,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:42:18,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 10:42:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:42:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 10:42:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=843, Unknown=10, NotChecked=0, Total=992 [2022-04-27 10:42:18,439 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:42:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:22,650 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 10:42:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 10:42:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-04-27 10:42:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:42:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:42:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2022-04-27 10:42:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:42:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2022-04-27 10:42:22,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 97 transitions. [2022-04-27 10:42:26,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:42:26,152 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:42:26,152 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 10:42:26,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=267, Invalid=1883, Unknown=12, NotChecked=0, Total=2162 [2022-04-27 10:42:26,153 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:42:26,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 209 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 295 Invalid, 0 Unknown, 212 Unchecked, 0.3s Time] [2022-04-27 10:42:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 10:42:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2022-04-27 10:42:26,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:42:26,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 76 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:42:26,247 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 76 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:42:26,247 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 76 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:42:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:26,250 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-27 10:42:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-27 10:42:26,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:42:26,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:42:26,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 86 states. [2022-04-27 10:42:26,251 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 86 states. [2022-04-27 10:42:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:26,254 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-27 10:42:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-27 10:42:26,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:42:26,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:42:26,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:42:26,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:42:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:42:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-27 10:42:26,266 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 61 [2022-04-27 10:42:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:42:26,266 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-27 10:42:26,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:42:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-27 10:42:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 10:42:26,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:42:26,268 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:42:26,294 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-04-27 10:42:26,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:42:26,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:42:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:42:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 648561106, now seen corresponding path program 3 times [2022-04-27 10:42:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:42:26,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335994314] [2022-04-27 10:42:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:42:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:42:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:42:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {2407#true} is VALID [2022-04-27 10:42:26,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2407#true} {2407#true} #70#return; {2407#true} is VALID [2022-04-27 10:42:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:42:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2412#(= main_~index~0 0)} #66#return; {2412#(= main_~index~0 0)} is VALID [2022-04-27 10:42:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:42:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:42:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:42:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-27 10:42:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 10:42:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-27 10:42:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:42:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:26,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:26,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:42:26,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {2407#true} is VALID [2022-04-27 10:42:26,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #70#return; {2407#true} is VALID [2022-04-27 10:42:26,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret5 := main(); {2407#true} is VALID [2022-04-27 10:42:26,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {2412#(= main_~index~0 0)} is VALID [2022-04-27 10:42:26,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2412#(= main_~index~0 0)} is VALID [2022-04-27 10:42:26,669 INFO L272 TraceCheckUtils]: 7: Hoare triple {2412#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,670 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2407#true} {2412#(= main_~index~0 0)} #66#return; {2412#(= main_~index~0 0)} is VALID [2022-04-27 10:42:26,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {2412#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2412#(= main_~index~0 0)} is VALID [2022-04-27 10:42:26,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {2412#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:26,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:26,671 INFO L272 TraceCheckUtils]: 15: Hoare triple {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,672 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2407#true} {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:26,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:26,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {2417#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:26,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:26,674 INFO L272 TraceCheckUtils]: 23: Hoare triple {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,674 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2407#true} {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:26,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:26,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {2422#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:26,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:26,676 INFO L272 TraceCheckUtils]: 31: Hoare triple {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,677 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2407#true} {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:26,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:26,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {2427#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:26,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:26,678 INFO L272 TraceCheckUtils]: 39: Hoare triple {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,679 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2407#true} {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:26,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:26,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {2432#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2437#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {2437#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} assume !(~index~0 % 4294967296 < 10000); {2408#false} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {2408#false} ~index~0 := 0; {2408#false} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:26,681 INFO L272 TraceCheckUtils]: 49: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,681 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2407#true} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {2408#false} havoc #t~mem4; {2408#false} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {2408#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2408#false} is VALID [2022-04-27 10:42:26,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:26,682 INFO L272 TraceCheckUtils]: 57: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,682 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2407#true} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:26,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {2408#false} havoc #t~mem4; {2408#false} is VALID [2022-04-27 10:42:26,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {2408#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2408#false} is VALID [2022-04-27 10:42:26,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:26,689 INFO L272 TraceCheckUtils]: 65: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:26,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:26,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:26,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:26,689 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2407#true} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L290 TraceCheckUtils]: 70: Hoare triple {2408#false} havoc #t~mem4; {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L290 TraceCheckUtils]: 71: Hoare triple {2408#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L290 TraceCheckUtils]: 72: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L272 TraceCheckUtils]: 73: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L290 TraceCheckUtils]: 74: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L290 TraceCheckUtils]: 75: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-27 10:42:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-27 10:42:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:42:26,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335994314] [2022-04-27 10:42:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335994314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:42:26,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737233614] [2022-04-27 10:42:26,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:42:26,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:42:26,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:42:26,696 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-04-27 10:42:26,705 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-04-27 10:42:27,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 10:42:27,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:42:27,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-27 10:42:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:27,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:42:27,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-04-27 10:42:28,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:42:28,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2022-04-27 10:42:28,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2022-04-27 10:42:28,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#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(29, 2); {2407#true} is VALID [2022-04-27 10:42:28,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:28,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #70#return; {2407#true} is VALID [2022-04-27 10:42:28,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret5 := main(); {2407#true} is VALID [2022-04-27 10:42:28,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-27 10:42:28,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-27 10:42:28,264 INFO L272 TraceCheckUtils]: 7: Hoare triple {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:28,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:28,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:28,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:28,265 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2407#true} {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} #66#return; {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-27 10:42:28,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-27 10:42:28,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {2469#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:42:28,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:42:28,266 INFO L272 TraceCheckUtils]: 15: Hoare triple {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:28,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:28,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:28,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:28,267 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2407#true} {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} #66#return; {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:42:28,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-27 10:42:28,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {2494#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} is VALID [2022-04-27 10:42:28,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} is VALID [2022-04-27 10:42:28,269 INFO L272 TraceCheckUtils]: 23: Hoare triple {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:28,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:28,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:28,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:28,270 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2407#true} {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} #66#return; {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} is VALID [2022-04-27 10:42:28,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} is VALID [2022-04-27 10:42:28,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {2519#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2544#(and (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} is VALID [2022-04-27 10:42:28,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {2544#(and (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2544#(and (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} is VALID [2022-04-27 10:42:28,272 INFO L272 TraceCheckUtils]: 31: Hoare triple {2544#(and (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:28,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {2407#true} ~cond := #in~cond; {2554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 10:42:28,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {2554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:42:28,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {2558#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 10:42:28,274 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2558#(not (= |assume_abort_if_not_#in~cond| 0))} {2544#(and (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} #66#return; {2565#(and (= |main_~#array~0.offset| 0) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= 2 (+ (- 1) main_~index~0)))} is VALID [2022-04-27 10:42:28,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {2565#(and (= |main_~#array~0.offset| 0) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= 2 (+ (- 1) main_~index~0)))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2569#(and (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1) (* (- 1) (mod main_~index~0 4294967296))) 4294967296) 1)) (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} is VALID [2022-04-27 10:42:28,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {2569#(and (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1) (* (- 1) (mod main_~index~0 4294967296))) 4294967296) 1)) (= |main_~#array~0.offset| 0) (= 2 (+ (- 1) main_~index~0)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2573#(and (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} is VALID [2022-04-27 10:42:28,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {2573#(and (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2573#(and (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} is VALID [2022-04-27 10:42:28,278 INFO L272 TraceCheckUtils]: 39: Hoare triple {2573#(and (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2580#(exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1)))} is VALID [2022-04-27 10:42:28,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {2580#(exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1)))} ~cond := #in~cond; {2584#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1))))} is VALID [2022-04-27 10:42:28,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {2584#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1))))} assume !(0 == ~cond); {2588#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1))))} is VALID [2022-04-27 10:42:28,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1))))} assume true; {2588#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1))))} is VALID [2022-04-27 10:42:28,280 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2588#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int)) (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12))) (- 4294967296)) (+ (div (+ (- 4) (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|) 12)) 4294967296) 1))))} {2573#(and (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} #66#return; {2595#(and (= |main_~#array~0.offset| 0) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} is VALID [2022-04-27 10:42:28,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {2595#(and (= |main_~#array~0.offset| 0) (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2599#(and (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1) (* (- 1) (mod main_~index~0 4294967296))) 4294967296) 1)) (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} is VALID [2022-04-27 10:42:28,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {2599#(and (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1) (* (- 1) (mod main_~index~0 4294967296))) 4294967296) 1)) (= |main_~#array~0.offset| 0) (= main_~index~0 4) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2603#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) (* (- 1) (mod (+ 4294967295 main_~index~0) 4294967296))) 4294967296) 1)) (= |main_~#array~0.offset| 0) (= 4 (+ (- 1) main_~index~0)) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} is VALID [2022-04-27 10:42:28,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {2603#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) (* (- 1) (mod (+ 4294967295 main_~index~0) 4294967296))) 4294967296) 1)) (= |main_~#array~0.offset| 0) (= 4 (+ (- 1) main_~index~0)) (< (div (+ 4294967295 (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 1))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) (- 4)) 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {2408#false} is VALID [2022-04-27 10:42:28,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {2408#false} ~index~0 := 0; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L272 TraceCheckUtils]: 49: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {2408#false} assume !(0 == ~cond); {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {2408#false} assume true; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2408#false} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {2408#false} havoc #t~mem4; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {2408#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L272 TraceCheckUtils]: 57: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {2408#false} assume !(0 == ~cond); {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {2408#false} assume true; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2408#false} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:28,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {2408#false} havoc #t~mem4; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {2408#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L272 TraceCheckUtils]: 65: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 67: Hoare triple {2408#false} assume !(0 == ~cond); {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {2408#false} assume true; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2408#false} {2408#false} #68#return; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 70: Hoare triple {2408#false} havoc #t~mem4; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 71: Hoare triple {2408#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {2408#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L272 TraceCheckUtils]: 73: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 74: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-27 10:42:28,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-27 10:42:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-27 10:42:28,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:42:31,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-04-27 10:42:31,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:42:31,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-27 10:42:31,701 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:42:31,709 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-04-27 10:42:31,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-04-27 10:42:32,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-27 10:42:32,613 INFO L290 TraceCheckUtils]: 75: Hoare triple {2700#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2408#false} is VALID [2022-04-27 10:42:32,613 INFO L290 TraceCheckUtils]: 74: Hoare triple {2704#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2700#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:42:32,616 INFO L272 TraceCheckUtils]: 73: Hoare triple {2708#(< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2704#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:42:32,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {2712#(or (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2708#(< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296))} is VALID [2022-04-27 10:42:32,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2712#(or (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} havoc #t~mem4; {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,619 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2407#true} {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} #68#return; {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,620 INFO L272 TraceCheckUtils]: 65: Hoare triple {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {2738#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2716#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2738#(or (< (mod (+ main_~index~0 1) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} havoc #t~mem4; {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,623 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2407#true} {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} #68#return; {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,623 INFO L290 TraceCheckUtils]: 60: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,623 INFO L290 TraceCheckUtils]: 59: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,623 INFO L272 TraceCheckUtils]: 57: Hoare triple {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {2764#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2742#(or (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (not (< (mod (+ 2 main_~index~0) 4294967296) 10000)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)))} is VALID [2022-04-27 10:42:32,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2764#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4))) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)))} is VALID [2022-04-27 10:42:32,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} havoc #t~mem4; {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} is VALID [2022-04-27 10:42:32,626 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2407#true} {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} #68#return; {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} is VALID [2022-04-27 10:42:32,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,626 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,626 INFO L272 TraceCheckUtils]: 49: Hoare triple {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {2790#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2768#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (<= 10000 (mod (+ main_~index~0 1) 4294967296)))} is VALID [2022-04-27 10:42:32,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {2794#(< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296))} ~index~0 := 0; {2790#(or (< (mod (+ 3 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)))} is VALID [2022-04-27 10:42:32,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {2798#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod main_~index~0 4294967296) 10000))} assume !(~index~0 % 4294967296 < 10000); {2794#(< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296))} is VALID [2022-04-27 10:42:32,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2798#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-27 10:42:32,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,631 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2407#true} {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} #66#return; {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,631 INFO L272 TraceCheckUtils]: 39: Hoare triple {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {2824#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2802#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {2828#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2824#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)) (< (mod (+ main_~index~0 1) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2828#(or (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,633 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2407#true} {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} #66#return; {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,634 INFO L272 TraceCheckUtils]: 31: Hoare triple {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2832#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,637 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2407#true} {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} #66#return; {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,638 INFO L272 TraceCheckUtils]: 23: Hoare triple {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2854#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (< (mod (+ 3 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,641 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2407#true} {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} #66#return; {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,641 INFO L272 TraceCheckUtils]: 15: Hoare triple {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2879#(or (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (< (mod (+ main_~index~0 4) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,644 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2407#true} {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} #66#return; {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2407#true} assume !(0 == ~cond); {2407#true} is VALID [2022-04-27 10:42:32,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2407#true} ~cond := #in~cond; {2407#true} is VALID [2022-04-27 10:42:32,644 INFO L272 TraceCheckUtils]: 7: Hoare triple {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2407#true} is VALID [2022-04-27 10:42:32,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {2904#(or (<= 10000 (mod (+ main_~index~0 4) 4294967296)) (< (mod (+ 5 main_~index~0) 4294967296) 10000))} is VALID [2022-04-27 10:42:32,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret5 := main(); {2407#true} is VALID [2022-04-27 10:42:32,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #70#return; {2407#true} is VALID [2022-04-27 10:42:32,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-27 10:42:32,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#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(29, 2); {2407#true} is VALID [2022-04-27 10:42:32,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2022-04-27 10:42:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 10:42:32,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737233614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:42:32,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:42:32,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 21] total 43 [2022-04-27 10:42:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078876021] [2022-04-27 10:42:32,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:42:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 77 [2022-04-27 10:42:32,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:42:32,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 10:42:32,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:42:32,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 10:42:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:42:32,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 10:42:32,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 10:42:32,781 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 10:42:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:44,250 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2022-04-27 10:42:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 10:42:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 77 [2022-04-27 10:42:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:42:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 10:42:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 219 transitions. [2022-04-27 10:42:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 10:42:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 219 transitions. [2022-04-27 10:42:44,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 219 transitions. [2022-04-27 10:42:44,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:42:44,836 INFO L225 Difference]: With dead ends: 225 [2022-04-27 10:42:44,836 INFO L226 Difference]: Without dead ends: 192 [2022-04-27 10:42:44,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1059, Invalid=6081, Unknown=0, NotChecked=0, Total=7140 [2022-04-27 10:42:44,840 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 445 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-27 10:42:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 124 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1936 Invalid, 0 Unknown, 269 Unchecked, 3.9s Time] [2022-04-27 10:42:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-27 10:42:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 127. [2022-04-27 10:42:45,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:42:45,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 127 states, 93 states have (on average 1.086021505376344) internal successors, (101), 95 states have internal predecessors, (101), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 10:42:45,106 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 127 states, 93 states have (on average 1.086021505376344) internal successors, (101), 95 states have internal predecessors, (101), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 10:42:45,107 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 127 states, 93 states have (on average 1.086021505376344) internal successors, (101), 95 states have internal predecessors, (101), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 10:42:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:45,114 INFO L93 Difference]: Finished difference Result 192 states and 224 transitions. [2022-04-27 10:42:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2022-04-27 10:42:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:42:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:42:45,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 93 states have (on average 1.086021505376344) internal successors, (101), 95 states have internal predecessors, (101), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 192 states. [2022-04-27 10:42:45,116 INFO L87 Difference]: Start difference. First operand has 127 states, 93 states have (on average 1.086021505376344) internal successors, (101), 95 states have internal predecessors, (101), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 192 states. [2022-04-27 10:42:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:45,122 INFO L93 Difference]: Finished difference Result 192 states and 224 transitions. [2022-04-27 10:42:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2022-04-27 10:42:45,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:42:45,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:42:45,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:42:45,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:42:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.086021505376344) internal successors, (101), 95 states have internal predecessors, (101), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 10:42:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2022-04-27 10:42:45,128 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 77 [2022-04-27 10:42:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:42:45,128 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2022-04-27 10:42:45,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 38 states have internal predecessors, (88), 21 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 10:42:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2022-04-27 10:42:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 10:42:45,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:42:45,130 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:42:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:42:45,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:42:45,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:42:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:42:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 616668035, now seen corresponding path program 4 times [2022-04-27 10:42:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:42:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367150772] [2022-04-27 10:42:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:42:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:42:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:42:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {3973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {3921#true} is VALID [2022-04-27 10:42:45,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3921#true} {3921#true} #70#return; {3921#true} is VALID [2022-04-27 10:42:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:42:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3926#(= main_~index~0 0)} #66#return; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:42:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:42:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:42:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-27 10:42:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-27 10:42:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-27 10:42:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:42:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-27 10:42:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-04-27 10:42:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:45,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {3921#true} call ULTIMATE.init(); {3973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:42:45,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {3973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {3921#true} is VALID [2022-04-27 10:42:45,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3921#true} #70#return; {3921#true} is VALID [2022-04-27 10:42:45,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {3921#true} call #t~ret5 := main(); {3921#true} is VALID [2022-04-27 10:42:45,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {3921#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:45,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {3926#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:45,550 INFO L272 TraceCheckUtils]: 7: Hoare triple {3926#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,550 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3921#true} {3926#(= main_~index~0 0)} #66#return; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:45,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {3926#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:45,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {3926#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:45,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:45,552 INFO L272 TraceCheckUtils]: 15: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,552 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3921#true} {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:45,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:45,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:45,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:45,553 INFO L272 TraceCheckUtils]: 23: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,554 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3921#true} {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:45,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:45,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:45,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:45,555 INFO L272 TraceCheckUtils]: 31: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,556 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3921#true} {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:45,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:45,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:45,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:45,557 INFO L272 TraceCheckUtils]: 39: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,558 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3921#true} {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:45,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:45,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:45,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:45,559 INFO L272 TraceCheckUtils]: 47: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,560 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3921#true} {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:45,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:45,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3956#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {3956#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {3922#false} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {3922#false} ~index~0 := 0; {3922#false} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:45,561 INFO L272 TraceCheckUtils]: 57: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,561 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 63: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 64: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:45,562 INFO L272 TraceCheckUtils]: 65: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 66: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 67: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,562 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:45,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:45,563 INFO L272 TraceCheckUtils]: 73: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 74: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,563 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 79: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:45,563 INFO L272 TraceCheckUtils]: 81: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:45,563 INFO L290 TraceCheckUtils]: 82: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 83: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:45,564 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 87: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 88: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L272 TraceCheckUtils]: 89: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 90: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 91: Hoare triple {3922#false} assume 0 == ~cond; {3922#false} is VALID [2022-04-27 10:42:45,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {3922#false} assume !false; {3922#false} is VALID [2022-04-27 10:42:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 10:42:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:42:45,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367150772] [2022-04-27 10:42:45,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367150772] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:42:45,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865253396] [2022-04-27 10:42:45,565 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:42:45,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:42:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:42:45,567 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-04-27 10:42:45,596 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-04-27 10:42:46,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:42:46,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:42:46,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 10:42:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:46,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:42:46,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {3921#true} call ULTIMATE.init(); {3921#true} is VALID [2022-04-27 10:42:46,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#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(29, 2); {3921#true} is VALID [2022-04-27 10:42:46,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3921#true} #70#return; {3921#true} is VALID [2022-04-27 10:42:46,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {3921#true} call #t~ret5 := main(); {3921#true} is VALID [2022-04-27 10:42:46,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {3921#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:46,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {3926#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:46,527 INFO L272 TraceCheckUtils]: 7: Hoare triple {3926#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,528 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3921#true} {3926#(= main_~index~0 0)} #66#return; {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:46,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {3926#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3926#(= main_~index~0 0)} is VALID [2022-04-27 10:42:46,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {3926#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:46,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:46,529 INFO L272 TraceCheckUtils]: 15: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,529 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3921#true} {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:46,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:46,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {3931#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:46,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:46,531 INFO L272 TraceCheckUtils]: 23: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,531 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3921#true} {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:46,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:46,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {3936#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:46,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:46,536 INFO L272 TraceCheckUtils]: 31: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,537 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3921#true} {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:46,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:46,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {3941#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:46,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:46,538 INFO L272 TraceCheckUtils]: 39: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,539 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3921#true} {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:46,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:46,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {3946#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:46,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:46,541 INFO L272 TraceCheckUtils]: 47: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,541 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3921#true} {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:46,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:46,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {3951#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4136#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:42:46,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {4136#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !(~index~0 % 4294967296 < 10000); {3922#false} is VALID [2022-04-27 10:42:46,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {3922#false} ~index~0 := 0; {3922#false} is VALID [2022-04-27 10:42:46,543 INFO L290 TraceCheckUtils]: 56: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,543 INFO L272 TraceCheckUtils]: 57: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:46,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {3922#false} assume !(0 == ~cond); {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {3922#false} assume true; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3922#false} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 62: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 63: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 64: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L272 TraceCheckUtils]: 65: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 66: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 67: Hoare triple {3922#false} assume !(0 == ~cond); {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 68: Hoare triple {3922#false} assume true; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3922#false} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,544 INFO L290 TraceCheckUtils]: 70: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 71: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 72: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L272 TraceCheckUtils]: 73: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 74: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 75: Hoare triple {3922#false} assume !(0 == ~cond); {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 76: Hoare triple {3922#false} assume true; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3922#false} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L272 TraceCheckUtils]: 81: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:46,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {3922#false} assume !(0 == ~cond); {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {3922#false} assume true; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {3922#false} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 87: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L272 TraceCheckUtils]: 89: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {3922#false} assume 0 == ~cond; {3922#false} is VALID [2022-04-27 10:42:46,546 INFO L290 TraceCheckUtils]: 92: Hoare triple {3922#false} assume !false; {3922#false} is VALID [2022-04-27 10:42:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-04-27 10:42:46,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 92: Hoare triple {3922#false} assume !false; {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 91: Hoare triple {3922#false} assume 0 == ~cond; {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {3922#false} ~cond := #in~cond; {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L272 TraceCheckUtils]: 89: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 88: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 87: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 86: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,901 INFO L290 TraceCheckUtils]: 84: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 83: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 82: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L272 TraceCheckUtils]: 81: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L272 TraceCheckUtils]: 73: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L272 TraceCheckUtils]: 65: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {3922#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3922#false} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {3922#false} havoc #t~mem4; {3922#false} is VALID [2022-04-27 10:42:46,903 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3921#true} {3922#false} #68#return; {3922#false} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L272 TraceCheckUtils]: 57: Hoare triple {3922#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {3922#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3922#false} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {3922#false} ~index~0 := 0; {3922#false} is VALID [2022-04-27 10:42:46,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {4368#(< (mod main_~index~0 4294967296) 10000)} assume !(~index~0 % 4294967296 < 10000); {3922#false} is VALID [2022-04-27 10:42:46,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4368#(< (mod main_~index~0 4294967296) 10000)} is VALID [2022-04-27 10:42:46,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,905 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3921#true} {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} #66#return; {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,905 INFO L272 TraceCheckUtils]: 47: Hoare triple {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4372#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,908 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3921#true} {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} #66#return; {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,908 INFO L272 TraceCheckUtils]: 39: Hoare triple {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4397#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,910 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3921#true} {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} #66#return; {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,910 INFO L272 TraceCheckUtils]: 31: Hoare triple {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4422#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,911 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3921#true} {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} #66#return; {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,912 INFO L272 TraceCheckUtils]: 23: Hoare triple {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4447#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,914 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3921#true} {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} #66#return; {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,914 INFO L272 TraceCheckUtils]: 15: Hoare triple {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4472#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,916 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3921#true} {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} #66#return; {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3921#true} assume !(0 == ~cond); {3921#true} is VALID [2022-04-27 10:42:46,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {3921#true} ~cond := #in~cond; {3921#true} is VALID [2022-04-27 10:42:46,916 INFO L272 TraceCheckUtils]: 7: Hoare triple {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3921#true} is VALID [2022-04-27 10:42:46,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3921#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {4497#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:42:46,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {3921#true} call #t~ret5 := main(); {3921#true} is VALID [2022-04-27 10:42:46,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3921#true} #70#return; {3921#true} is VALID [2022-04-27 10:42:46,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} assume true; {3921#true} is VALID [2022-04-27 10:42:46,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#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(29, 2); {3921#true} is VALID [2022-04-27 10:42:46,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {3921#true} call ULTIMATE.init(); {3921#true} is VALID [2022-04-27 10:42:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 10:42:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865253396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:42:46,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:42:46,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-27 10:42:46,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027767329] [2022-04-27 10:42:46,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:42:46,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 93 [2022-04-27 10:42:46,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:42:46,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 10:42:46,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:42:46,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:42:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:42:46,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:42:46,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:42:46,989 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 10:42:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:50,181 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2022-04-27 10:42:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:42:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 93 [2022-04-27 10:42:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:42:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 10:42:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-27 10:42:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 10:42:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-27 10:42:50,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-27 10:42:50,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:42:50,444 INFO L225 Difference]: With dead ends: 211 [2022-04-27 10:42:50,444 INFO L226 Difference]: Without dead ends: 159 [2022-04-27 10:42:50,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:42:50,445 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 191 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:42:50,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 79 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 10:42:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-27 10:42:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2022-04-27 10:42:50,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:42:50,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 116 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 10:42:50,693 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 116 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 10:42:50,693 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 116 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 10:42:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:50,698 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2022-04-27 10:42:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2022-04-27 10:42:50,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:42:50,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:42:50,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 159 states. [2022-04-27 10:42:50,700 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 159 states. [2022-04-27 10:42:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:42:50,704 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2022-04-27 10:42:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2022-04-27 10:42:50,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:42:50,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:42:50,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:42:50,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:42:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 10:42:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2022-04-27 10:42:50,709 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 93 [2022-04-27 10:42:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:42:50,709 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2022-04-27 10:42:50,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 10:42:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2022-04-27 10:42:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-27 10:42:50,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:42:50,711 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:42:50,732 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-04-27 10:42:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:42:50,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:42:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:42:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1102839803, now seen corresponding path program 5 times [2022-04-27 10:42:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:42:50,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224313118] [2022-04-27 10:42:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:42:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:42:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:42:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {5442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {5354#true} is VALID [2022-04-27 10:42:51,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5354#true} {5354#true} #70#return; {5354#true} is VALID [2022-04-27 10:42:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:42:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5359#(= main_~index~0 0)} #66#return; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:42:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:42:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:42:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:42:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-27 10:42:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-27 10:42:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:42:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #66#return; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:42:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-27 10:42:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #66#return; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:42:51,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 10:42:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #66#return; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:42:51,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-27 10:42:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #66#return; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:42:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-27 10:42:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #66#return; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:42:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-27 10:42:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #66#return; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:42:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-04-27 10:42:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #66#return; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:42:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-04-27 10:42:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #66#return; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:42:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-04-27 10:42:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:42:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-27 10:42:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:42:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-04-27 10:42:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:42:51,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:42:51,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {5354#true} call ULTIMATE.init(); {5442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:42:51,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {5354#true} is VALID [2022-04-27 10:42:51,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5354#true} #70#return; {5354#true} is VALID [2022-04-27 10:42:51,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {5354#true} call #t~ret5 := main(); {5354#true} is VALID [2022-04-27 10:42:51,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {5354#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:42:51,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {5359#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:42:51,376 INFO L272 TraceCheckUtils]: 7: Hoare triple {5359#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,376 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5354#true} {5359#(= main_~index~0 0)} #66#return; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:42:51,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {5359#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:42:51,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {5359#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:51,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:51,378 INFO L272 TraceCheckUtils]: 15: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,378 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5354#true} {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:51,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:42:51,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:51,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:51,380 INFO L272 TraceCheckUtils]: 23: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,380 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5354#true} {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:51,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:42:51,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:51,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:51,382 INFO L272 TraceCheckUtils]: 31: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,383 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5354#true} {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:51,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:42:51,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:51,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:51,384 INFO L272 TraceCheckUtils]: 39: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,385 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5354#true} {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:51,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:42:51,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:51,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:51,386 INFO L272 TraceCheckUtils]: 47: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,387 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5354#true} {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:51,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:42:51,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:42:51,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:42:51,388 INFO L272 TraceCheckUtils]: 55: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,389 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5354#true} {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #66#return; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:42:51,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:42:51,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:42:51,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:42:51,390 INFO L272 TraceCheckUtils]: 63: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,391 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5354#true} {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #66#return; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:42:51,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:42:51,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:42:51,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:42:51,392 INFO L272 TraceCheckUtils]: 71: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,393 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5354#true} {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #66#return; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:42:51,393 INFO L290 TraceCheckUtils]: 76: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:42:51,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:42:51,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:42:51,394 INFO L272 TraceCheckUtils]: 79: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,395 INFO L290 TraceCheckUtils]: 82: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,395 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {5354#true} {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #66#return; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:42:51,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:42:51,396 INFO L290 TraceCheckUtils]: 85: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:42:51,396 INFO L290 TraceCheckUtils]: 86: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:42:51,396 INFO L272 TraceCheckUtils]: 87: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,397 INFO L290 TraceCheckUtils]: 89: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,397 INFO L290 TraceCheckUtils]: 90: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,397 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5354#true} {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #66#return; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:42:51,398 INFO L290 TraceCheckUtils]: 92: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:42:51,398 INFO L290 TraceCheckUtils]: 93: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:42:51,398 INFO L290 TraceCheckUtils]: 94: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:42:51,398 INFO L272 TraceCheckUtils]: 95: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,399 INFO L290 TraceCheckUtils]: 96: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,399 INFO L290 TraceCheckUtils]: 97: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,399 INFO L290 TraceCheckUtils]: 98: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,399 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {5354#true} {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #66#return; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:42:51,400 INFO L290 TraceCheckUtils]: 100: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:42:51,400 INFO L290 TraceCheckUtils]: 101: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:42:51,400 INFO L290 TraceCheckUtils]: 102: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:42:51,401 INFO L272 TraceCheckUtils]: 103: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,401 INFO L290 TraceCheckUtils]: 104: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,401 INFO L290 TraceCheckUtils]: 105: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,401 INFO L290 TraceCheckUtils]: 106: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,401 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5354#true} {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #66#return; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:42:51,402 INFO L290 TraceCheckUtils]: 108: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:42:51,402 INFO L290 TraceCheckUtils]: 109: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:42:51,403 INFO L290 TraceCheckUtils]: 110: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:42:51,403 INFO L272 TraceCheckUtils]: 111: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,403 INFO L290 TraceCheckUtils]: 112: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,403 INFO L290 TraceCheckUtils]: 113: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,403 INFO L290 TraceCheckUtils]: 114: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,403 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {5354#true} {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #66#return; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:42:51,404 INFO L290 TraceCheckUtils]: 116: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:42:51,404 INFO L290 TraceCheckUtils]: 117: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5429#(and (<= main_~index~0 14) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:42:51,405 INFO L290 TraceCheckUtils]: 118: Hoare triple {5429#(and (<= main_~index~0 14) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {5355#false} is VALID [2022-04-27 10:42:51,405 INFO L290 TraceCheckUtils]: 119: Hoare triple {5355#false} ~index~0 := 0; {5355#false} is VALID [2022-04-27 10:42:51,405 INFO L290 TraceCheckUtils]: 120: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:42:51,405 INFO L272 TraceCheckUtils]: 121: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,405 INFO L290 TraceCheckUtils]: 122: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,405 INFO L290 TraceCheckUtils]: 123: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,405 INFO L290 TraceCheckUtils]: 124: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,405 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 126: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 127: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 128: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L272 TraceCheckUtils]: 129: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 130: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 131: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 132: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,406 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 134: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 135: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L290 TraceCheckUtils]: 136: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:42:51,406 INFO L272 TraceCheckUtils]: 137: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 138: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 139: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 140: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:42:51,407 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 142: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 143: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 144: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L272 TraceCheckUtils]: 145: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 146: Hoare triple {5355#false} ~cond := #in~cond; {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 147: Hoare triple {5355#false} assume 0 == ~cond; {5355#false} is VALID [2022-04-27 10:42:51,407 INFO L290 TraceCheckUtils]: 148: Hoare triple {5355#false} assume !false; {5355#false} is VALID [2022-04-27 10:42:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 6 proven. 378 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-04-27 10:42:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:42:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224313118] [2022-04-27 10:42:51,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224313118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:42:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387311392] [2022-04-27 10:42:51,409 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:42:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:42:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:42:51,410 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-04-27 10:42:51,438 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-04-27 10:43:27,487 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-04-27 10:43:27,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:43:27,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 10:43:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:27,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:43:28,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {5354#true} call ULTIMATE.init(); {5354#true} is VALID [2022-04-27 10:43:28,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#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(29, 2); {5354#true} is VALID [2022-04-27 10:43:28,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5354#true} #70#return; {5354#true} is VALID [2022-04-27 10:43:28,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {5354#true} call #t~ret5 := main(); {5354#true} is VALID [2022-04-27 10:43:28,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {5354#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:43:28,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {5359#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:43:28,236 INFO L272 TraceCheckUtils]: 7: Hoare triple {5359#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,236 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5354#true} {5359#(= main_~index~0 0)} #66#return; {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:43:28,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {5359#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5359#(= main_~index~0 0)} is VALID [2022-04-27 10:43:28,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {5359#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:28,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:28,238 INFO L272 TraceCheckUtils]: 15: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,238 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5354#true} {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:28,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:28,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {5364#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:28,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:28,239 INFO L272 TraceCheckUtils]: 23: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,240 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5354#true} {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:28,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:28,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {5369#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:28,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:28,241 INFO L272 TraceCheckUtils]: 31: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,242 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5354#true} {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:28,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:28,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {5374#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:28,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:28,243 INFO L272 TraceCheckUtils]: 39: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,244 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5354#true} {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:28,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:28,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {5379#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:28,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:28,247 INFO L272 TraceCheckUtils]: 47: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,247 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5354#true} {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:28,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:28,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {5384#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:28,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:28,248 INFO L272 TraceCheckUtils]: 55: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,249 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5354#true} {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #66#return; {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:28,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:28,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {5389#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:28,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:28,252 INFO L272 TraceCheckUtils]: 63: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,253 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5354#true} {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #66#return; {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:28,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:28,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {5394#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:28,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:28,254 INFO L272 TraceCheckUtils]: 71: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,254 INFO L290 TraceCheckUtils]: 73: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,254 INFO L290 TraceCheckUtils]: 74: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,255 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5354#true} {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #66#return; {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:28,255 INFO L290 TraceCheckUtils]: 76: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:28,256 INFO L290 TraceCheckUtils]: 77: Hoare triple {5399#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:28,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:28,256 INFO L272 TraceCheckUtils]: 79: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,256 INFO L290 TraceCheckUtils]: 82: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,257 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {5354#true} {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #66#return; {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:28,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:28,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {5404#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:28,258 INFO L290 TraceCheckUtils]: 86: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:28,258 INFO L272 TraceCheckUtils]: 87: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,258 INFO L290 TraceCheckUtils]: 90: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,258 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5354#true} {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #66#return; {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:28,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:28,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {5409#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:28,260 INFO L290 TraceCheckUtils]: 94: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:28,260 INFO L272 TraceCheckUtils]: 95: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,260 INFO L290 TraceCheckUtils]: 96: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,260 INFO L290 TraceCheckUtils]: 97: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,260 INFO L290 TraceCheckUtils]: 98: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,260 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {5354#true} {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #66#return; {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:28,261 INFO L290 TraceCheckUtils]: 100: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:28,261 INFO L290 TraceCheckUtils]: 101: Hoare triple {5414#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:28,261 INFO L290 TraceCheckUtils]: 102: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:28,261 INFO L272 TraceCheckUtils]: 103: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,262 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5354#true} {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #66#return; {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:28,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:28,263 INFO L290 TraceCheckUtils]: 109: Hoare triple {5419#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:28,263 INFO L290 TraceCheckUtils]: 110: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:28,263 INFO L272 TraceCheckUtils]: 111: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:28,263 INFO L290 TraceCheckUtils]: 112: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:28,263 INFO L290 TraceCheckUtils]: 113: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:28,263 INFO L290 TraceCheckUtils]: 114: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:28,264 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {5354#true} {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #66#return; {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:28,264 INFO L290 TraceCheckUtils]: 116: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:28,265 INFO L290 TraceCheckUtils]: 117: Hoare triple {5424#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5797#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:43:28,267 INFO L290 TraceCheckUtils]: 118: Hoare triple {5797#(and (<= 14 main_~index~0) (<= main_~index~0 14))} assume !(~index~0 % 4294967296 < 10000); {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 119: Hoare triple {5355#false} ~index~0 := 0; {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 120: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L272 TraceCheckUtils]: 121: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 122: Hoare triple {5355#false} ~cond := #in~cond; {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 123: Hoare triple {5355#false} assume !(0 == ~cond); {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 124: Hoare triple {5355#false} assume true; {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {5355#false} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 126: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 127: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 128: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L272 TraceCheckUtils]: 129: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5355#false} is VALID [2022-04-27 10:43:28,268 INFO L290 TraceCheckUtils]: 130: Hoare triple {5355#false} ~cond := #in~cond; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 131: Hoare triple {5355#false} assume !(0 == ~cond); {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 132: Hoare triple {5355#false} assume true; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {5355#false} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 134: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 135: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 136: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L272 TraceCheckUtils]: 137: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 138: Hoare triple {5355#false} ~cond := #in~cond; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 139: Hoare triple {5355#false} assume !(0 == ~cond); {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 140: Hoare triple {5355#false} assume true; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {5355#false} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:43:28,269 INFO L290 TraceCheckUtils]: 142: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:43:28,270 INFO L290 TraceCheckUtils]: 143: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:43:28,270 INFO L290 TraceCheckUtils]: 144: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:28,270 INFO L272 TraceCheckUtils]: 145: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5355#false} is VALID [2022-04-27 10:43:28,270 INFO L290 TraceCheckUtils]: 146: Hoare triple {5355#false} ~cond := #in~cond; {5355#false} is VALID [2022-04-27 10:43:28,270 INFO L290 TraceCheckUtils]: 147: Hoare triple {5355#false} assume 0 == ~cond; {5355#false} is VALID [2022-04-27 10:43:28,270 INFO L290 TraceCheckUtils]: 148: Hoare triple {5355#false} assume !false; {5355#false} is VALID [2022-04-27 10:43:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-27 10:43:28,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:43:29,098 INFO L290 TraceCheckUtils]: 148: Hoare triple {5355#false} assume !false; {5355#false} is VALID [2022-04-27 10:43:29,098 INFO L290 TraceCheckUtils]: 147: Hoare triple {5355#false} assume 0 == ~cond; {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 146: Hoare triple {5355#false} ~cond := #in~cond; {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L272 TraceCheckUtils]: 145: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 144: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 143: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 142: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 140: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 139: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 138: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,099 INFO L272 TraceCheckUtils]: 137: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 136: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:29,099 INFO L290 TraceCheckUtils]: 135: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 134: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 132: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 131: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 130: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,100 INFO L272 TraceCheckUtils]: 129: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 128: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 127: Hoare triple {5355#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 126: Hoare triple {5355#false} havoc #t~mem4; {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {5354#true} {5355#false} #68#return; {5355#false} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 124: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,100 INFO L290 TraceCheckUtils]: 123: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,101 INFO L290 TraceCheckUtils]: 122: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,101 INFO L272 TraceCheckUtils]: 121: Hoare triple {5355#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,101 INFO L290 TraceCheckUtils]: 120: Hoare triple {5355#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5355#false} is VALID [2022-04-27 10:43:29,101 INFO L290 TraceCheckUtils]: 119: Hoare triple {5355#false} ~index~0 := 0; {5355#false} is VALID [2022-04-27 10:43:29,101 INFO L290 TraceCheckUtils]: 118: Hoare triple {5981#(< (mod main_~index~0 4294967296) 10000)} assume !(~index~0 % 4294967296 < 10000); {5355#false} is VALID [2022-04-27 10:43:29,102 INFO L290 TraceCheckUtils]: 117: Hoare triple {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5981#(< (mod main_~index~0 4294967296) 10000)} is VALID [2022-04-27 10:43:29,103 INFO L290 TraceCheckUtils]: 116: Hoare triple {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,103 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {5354#true} {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} #66#return; {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,103 INFO L290 TraceCheckUtils]: 114: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,103 INFO L290 TraceCheckUtils]: 113: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,103 INFO L290 TraceCheckUtils]: 112: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,103 INFO L272 TraceCheckUtils]: 111: Hoare triple {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,104 INFO L290 TraceCheckUtils]: 110: Hoare triple {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,105 INFO L290 TraceCheckUtils]: 109: Hoare triple {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {5985#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,105 INFO L290 TraceCheckUtils]: 108: Hoare triple {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,106 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5354#true} {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} #66#return; {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,106 INFO L290 TraceCheckUtils]: 106: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,106 INFO L290 TraceCheckUtils]: 105: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,106 INFO L290 TraceCheckUtils]: 104: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,106 INFO L272 TraceCheckUtils]: 103: Hoare triple {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,107 INFO L290 TraceCheckUtils]: 102: Hoare triple {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,107 INFO L290 TraceCheckUtils]: 101: Hoare triple {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6010#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,108 INFO L290 TraceCheckUtils]: 100: Hoare triple {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,108 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {5354#true} {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} #66#return; {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,108 INFO L290 TraceCheckUtils]: 98: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,108 INFO L290 TraceCheckUtils]: 97: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,108 INFO L290 TraceCheckUtils]: 96: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,108 INFO L272 TraceCheckUtils]: 95: Hoare triple {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,109 INFO L290 TraceCheckUtils]: 94: Hoare triple {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6035#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,109 INFO L290 TraceCheckUtils]: 92: Hoare triple {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,110 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5354#true} {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} #66#return; {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,110 INFO L272 TraceCheckUtils]: 87: Hoare triple {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,111 INFO L290 TraceCheckUtils]: 86: Hoare triple {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,111 INFO L290 TraceCheckUtils]: 85: Hoare triple {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6060#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,112 INFO L290 TraceCheckUtils]: 84: Hoare triple {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,112 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {5354#true} {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} #66#return; {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,112 INFO L290 TraceCheckUtils]: 82: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,112 INFO L290 TraceCheckUtils]: 81: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,113 INFO L290 TraceCheckUtils]: 80: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,113 INFO L272 TraceCheckUtils]: 79: Hoare triple {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6085#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,115 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5354#true} {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} #66#return; {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,115 INFO L272 TraceCheckUtils]: 71: Hoare triple {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6110#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,117 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5354#true} {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} #66#return; {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,117 INFO L272 TraceCheckUtils]: 63: Hoare triple {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6135#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,119 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5354#true} {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} #66#return; {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,119 INFO L290 TraceCheckUtils]: 56: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,119 INFO L272 TraceCheckUtils]: 55: Hoare triple {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6160#(< (mod (+ main_~index~0 8) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,121 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5354#true} {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} #66#return; {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,121 INFO L272 TraceCheckUtils]: 47: Hoare triple {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6185#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,122 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5354#true} {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} #66#return; {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,123 INFO L272 TraceCheckUtils]: 39: Hoare triple {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6210#(< (mod (+ main_~index~0 10) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,124 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5354#true} {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} #66#return; {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,125 INFO L272 TraceCheckUtils]: 31: Hoare triple {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6235#(< (mod (+ main_~index~0 11) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,126 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5354#true} {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} #66#return; {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,126 INFO L272 TraceCheckUtils]: 23: Hoare triple {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6260#(< (mod (+ main_~index~0 12) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,128 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5354#true} {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} #66#return; {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,128 INFO L272 TraceCheckUtils]: 15: Hoare triple {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {6285#(< (mod (+ main_~index~0 13) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,130 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5354#true} {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} #66#return; {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {5354#true} assume !(0 == ~cond); {5354#true} is VALID [2022-04-27 10:43:29,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {5354#true} ~cond := #in~cond; {5354#true} is VALID [2022-04-27 10:43:29,130 INFO L272 TraceCheckUtils]: 7: Hoare triple {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {5354#true} is VALID [2022-04-27 10:43:29,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {5354#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {6310#(< (mod (+ 14 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:43:29,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {5354#true} call #t~ret5 := main(); {5354#true} is VALID [2022-04-27 10:43:29,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5354#true} {5354#true} #70#return; {5354#true} is VALID [2022-04-27 10:43:29,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume true; {5354#true} is VALID [2022-04-27 10:43:29,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#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(29, 2); {5354#true} is VALID [2022-04-27 10:43:29,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {5354#true} call ULTIMATE.init(); {5354#true} is VALID [2022-04-27 10:43:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 6 proven. 378 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-04-27 10:43:29,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387311392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:43:29,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:43:29,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-27 10:43:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530488266] [2022-04-27 10:43:29,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:43:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 149 [2022-04-27 10:43:29,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:43:29,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 10:43:29,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:43:29,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 10:43:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:43:29,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 10:43:29,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 10:43:29,255 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 10:43:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:43:52,421 INFO L93 Difference]: Finished difference Result 320 states and 388 transitions. [2022-04-27 10:43:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 10:43:52,421 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 149 [2022-04-27 10:43:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:43:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 10:43:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 345 transitions. [2022-04-27 10:43:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 10:43:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 345 transitions. [2022-04-27 10:43:52,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 345 transitions. [2022-04-27 10:43:52,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:43:52,871 INFO L225 Difference]: With dead ends: 320 [2022-04-27 10:43:52,871 INFO L226 Difference]: Without dead ends: 287 [2022-04-27 10:43:52,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1114, Invalid=2917, Unknown=1, NotChecked=0, Total=4032 [2022-04-27 10:43:52,873 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 549 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-27 10:43:52,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 138 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-27 10:43:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-27 10:43:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 180. [2022-04-27 10:43:53,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:43:53,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 180 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 10:43:53,327 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 180 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 10:43:53,328 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 180 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 10:43:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:43:53,338 INFO L93 Difference]: Finished difference Result 287 states and 339 transitions. [2022-04-27 10:43:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 339 transitions. [2022-04-27 10:43:53,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:43:53,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:43:53,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 287 states. [2022-04-27 10:43:53,341 INFO L87 Difference]: Start difference. First operand has 180 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 287 states. [2022-04-27 10:43:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:43:53,351 INFO L93 Difference]: Finished difference Result 287 states and 339 transitions. [2022-04-27 10:43:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 339 transitions. [2022-04-27 10:43:53,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:43:53,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:43:53,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:43:53,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:43:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 10:43:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2022-04-27 10:43:53,359 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 149 [2022-04-27 10:43:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:43:53,360 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2022-04-27 10:43:53,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 33 states have internal predecessors, (108), 30 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 10:43:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2022-04-27 10:43:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-04-27 10:43:53,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:43:53,365 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:43:53,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 10:43:53,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:43:53,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:43:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:43:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1415471691, now seen corresponding path program 6 times [2022-04-27 10:43:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:43:53,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723572148] [2022-04-27 10:43:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:43:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:43:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:43:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {7883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {7715#true} is VALID [2022-04-27 10:43:54,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7715#true} {7715#true} #70#return; {7715#true} is VALID [2022-04-27 10:43:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:43:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7720#(= main_~index~0 0)} #66#return; {7720#(= main_~index~0 0)} is VALID [2022-04-27 10:43:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:43:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:43:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:43:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:54,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-27 10:43:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-27 10:43:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:43:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #66#return; {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:54,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-27 10:43:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #66#return; {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 10:43:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #66#return; {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-27 10:43:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #66#return; {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:54,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-27 10:43:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #66#return; {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-27 10:43:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #66#return; {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-04-27 10:43:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #66#return; {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-04-27 10:43:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #66#return; {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-04-27 10:43:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} #66#return; {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:43:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-04-27 10:43:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} #66#return; {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} is VALID [2022-04-27 10:43:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-04-27 10:43:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} #66#return; {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} is VALID [2022-04-27 10:43:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-04-27 10:43:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} #66#return; {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} is VALID [2022-04-27 10:43:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-04-27 10:43:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} #66#return; {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} is VALID [2022-04-27 10:43:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-04-27 10:43:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} #66#return; {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} is VALID [2022-04-27 10:43:54,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-04-27 10:43:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} #66#return; {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} is VALID [2022-04-27 10:43:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-04-27 10:43:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} #66#return; {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} is VALID [2022-04-27 10:43:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-04-27 10:43:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} #66#return; {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} is VALID [2022-04-27 10:43:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-04-27 10:43:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} #66#return; {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} is VALID [2022-04-27 10:43:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-04-27 10:43:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} #66#return; {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} is VALID [2022-04-27 10:43:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-04-27 10:43:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} #66#return; {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} is VALID [2022-04-27 10:43:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-04-27 10:43:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} #66#return; {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} is VALID [2022-04-27 10:43:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-04-27 10:43:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} #66#return; {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} is VALID [2022-04-27 10:43:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-04-27 10:43:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} #66#return; {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} is VALID [2022-04-27 10:43:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-04-27 10:43:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} #66#return; {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} is VALID [2022-04-27 10:43:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-04-27 10:43:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7716#false} #68#return; {7716#false} is VALID [2022-04-27 10:43:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-04-27 10:43:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7716#false} #68#return; {7716#false} is VALID [2022-04-27 10:43:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-04-27 10:43:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:54,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7716#false} #68#return; {7716#false} is VALID [2022-04-27 10:43:54,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:43:54,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {7883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(29, 2); {7715#true} is VALID [2022-04-27 10:43:54,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7715#true} #70#return; {7715#true} is VALID [2022-04-27 10:43:54,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {7715#true} call #t~ret5 := main(); {7715#true} is VALID [2022-04-27 10:43:54,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {7715#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {7720#(= main_~index~0 0)} is VALID [2022-04-27 10:43:54,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {7720#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7720#(= main_~index~0 0)} is VALID [2022-04-27 10:43:54,693 INFO L272 TraceCheckUtils]: 7: Hoare triple {7720#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,693 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7715#true} {7720#(= main_~index~0 0)} #66#return; {7720#(= main_~index~0 0)} is VALID [2022-04-27 10:43:54,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {7720#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7720#(= main_~index~0 0)} is VALID [2022-04-27 10:43:54,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {7720#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:54,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:54,694 INFO L272 TraceCheckUtils]: 15: Hoare triple {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,695 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7715#true} {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #66#return; {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:54,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:43:54,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {7725#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:54,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:54,697 INFO L272 TraceCheckUtils]: 23: Hoare triple {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,697 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7715#true} {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #66#return; {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:54,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:43:54,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {7730#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:54,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:54,699 INFO L272 TraceCheckUtils]: 31: Hoare triple {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,700 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {7715#true} {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #66#return; {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:54,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:43:54,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {7735#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:54,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:54,701 INFO L272 TraceCheckUtils]: 39: Hoare triple {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,702 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7715#true} {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #66#return; {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:54,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:43:54,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {7740#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:54,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:54,703 INFO L272 TraceCheckUtils]: 47: Hoare triple {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,704 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7715#true} {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #66#return; {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:54,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:43:54,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {7745#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:54,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:54,705 INFO L272 TraceCheckUtils]: 55: Hoare triple {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,706 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7715#true} {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #66#return; {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:54,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:43:54,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {7750#(and (<= 6 main_~index~0) (<= main_~index~0 6))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:54,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:54,707 INFO L272 TraceCheckUtils]: 63: Hoare triple {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,708 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7715#true} {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #66#return; {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:54,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:43:54,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {7755#(and (<= 7 main_~index~0) (<= main_~index~0 7))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:54,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:54,710 INFO L272 TraceCheckUtils]: 71: Hoare triple {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,710 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7715#true} {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #66#return; {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:54,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:43:54,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {7760#(and (<= 8 main_~index~0) (<= main_~index~0 8))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:54,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:54,712 INFO L272 TraceCheckUtils]: 79: Hoare triple {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,712 INFO L290 TraceCheckUtils]: 80: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,712 INFO L290 TraceCheckUtils]: 81: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,712 INFO L290 TraceCheckUtils]: 82: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,712 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7715#true} {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #66#return; {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:54,713 INFO L290 TraceCheckUtils]: 84: Hoare triple {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:43:54,713 INFO L290 TraceCheckUtils]: 85: Hoare triple {7765#(and (<= main_~index~0 9) (<= 9 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:54,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:54,714 INFO L272 TraceCheckUtils]: 87: Hoare triple {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,714 INFO L290 TraceCheckUtils]: 89: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,714 INFO L290 TraceCheckUtils]: 90: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,715 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {7715#true} {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #66#return; {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:54,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:43:54,716 INFO L290 TraceCheckUtils]: 93: Hoare triple {7770#(and (<= main_~index~0 10) (<= 10 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:54,716 INFO L290 TraceCheckUtils]: 94: Hoare triple {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:54,716 INFO L272 TraceCheckUtils]: 95: Hoare triple {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,716 INFO L290 TraceCheckUtils]: 96: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,716 INFO L290 TraceCheckUtils]: 97: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,716 INFO L290 TraceCheckUtils]: 98: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,717 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7715#true} {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #66#return; {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:54,717 INFO L290 TraceCheckUtils]: 100: Hoare triple {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:43:54,718 INFO L290 TraceCheckUtils]: 101: Hoare triple {7775#(and (<= main_~index~0 11) (<= 11 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:54,718 INFO L290 TraceCheckUtils]: 102: Hoare triple {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:54,718 INFO L272 TraceCheckUtils]: 103: Hoare triple {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,718 INFO L290 TraceCheckUtils]: 104: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,718 INFO L290 TraceCheckUtils]: 105: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,718 INFO L290 TraceCheckUtils]: 106: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,719 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {7715#true} {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #66#return; {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:54,719 INFO L290 TraceCheckUtils]: 108: Hoare triple {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:43:54,720 INFO L290 TraceCheckUtils]: 109: Hoare triple {7780#(and (<= main_~index~0 12) (<= 12 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:54,720 INFO L290 TraceCheckUtils]: 110: Hoare triple {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:54,720 INFO L272 TraceCheckUtils]: 111: Hoare triple {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,720 INFO L290 TraceCheckUtils]: 112: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,720 INFO L290 TraceCheckUtils]: 113: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,721 INFO L290 TraceCheckUtils]: 114: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,722 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {7715#true} {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #66#return; {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:54,722 INFO L290 TraceCheckUtils]: 116: Hoare triple {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:43:54,723 INFO L290 TraceCheckUtils]: 117: Hoare triple {7785#(and (<= 13 main_~index~0) (<= main_~index~0 13))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:43:54,723 INFO L290 TraceCheckUtils]: 118: Hoare triple {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:43:54,723 INFO L272 TraceCheckUtils]: 119: Hoare triple {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,723 INFO L290 TraceCheckUtils]: 120: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,723 INFO L290 TraceCheckUtils]: 121: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,723 INFO L290 TraceCheckUtils]: 122: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,724 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {7715#true} {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} #66#return; {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:43:54,724 INFO L290 TraceCheckUtils]: 124: Hoare triple {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:43:54,725 INFO L290 TraceCheckUtils]: 125: Hoare triple {7790#(and (<= 14 main_~index~0) (<= main_~index~0 14))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} is VALID [2022-04-27 10:43:54,725 INFO L290 TraceCheckUtils]: 126: Hoare triple {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} is VALID [2022-04-27 10:43:54,725 INFO L272 TraceCheckUtils]: 127: Hoare triple {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,725 INFO L290 TraceCheckUtils]: 128: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,725 INFO L290 TraceCheckUtils]: 129: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,725 INFO L290 TraceCheckUtils]: 130: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,726 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {7715#true} {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} #66#return; {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} is VALID [2022-04-27 10:43:54,726 INFO L290 TraceCheckUtils]: 132: Hoare triple {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} is VALID [2022-04-27 10:43:54,727 INFO L290 TraceCheckUtils]: 133: Hoare triple {7795#(and (<= 15 main_~index~0) (<= main_~index~0 15))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} is VALID [2022-04-27 10:43:54,727 INFO L290 TraceCheckUtils]: 134: Hoare triple {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} is VALID [2022-04-27 10:43:54,727 INFO L272 TraceCheckUtils]: 135: Hoare triple {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,727 INFO L290 TraceCheckUtils]: 136: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,728 INFO L290 TraceCheckUtils]: 137: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,728 INFO L290 TraceCheckUtils]: 138: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,728 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {7715#true} {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} #66#return; {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} is VALID [2022-04-27 10:43:54,729 INFO L290 TraceCheckUtils]: 140: Hoare triple {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} is VALID [2022-04-27 10:43:54,729 INFO L290 TraceCheckUtils]: 141: Hoare triple {7800#(and (<= main_~index~0 16) (<= 16 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} is VALID [2022-04-27 10:43:54,729 INFO L290 TraceCheckUtils]: 142: Hoare triple {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} is VALID [2022-04-27 10:43:54,730 INFO L272 TraceCheckUtils]: 143: Hoare triple {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,730 INFO L290 TraceCheckUtils]: 144: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,730 INFO L290 TraceCheckUtils]: 145: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,730 INFO L290 TraceCheckUtils]: 146: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,730 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {7715#true} {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} #66#return; {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} is VALID [2022-04-27 10:43:54,731 INFO L290 TraceCheckUtils]: 148: Hoare triple {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} is VALID [2022-04-27 10:43:54,731 INFO L290 TraceCheckUtils]: 149: Hoare triple {7805#(and (<= 17 main_~index~0) (<= main_~index~0 17))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} is VALID [2022-04-27 10:43:54,732 INFO L290 TraceCheckUtils]: 150: Hoare triple {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} is VALID [2022-04-27 10:43:54,732 INFO L272 TraceCheckUtils]: 151: Hoare triple {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,732 INFO L290 TraceCheckUtils]: 152: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,732 INFO L290 TraceCheckUtils]: 153: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,732 INFO L290 TraceCheckUtils]: 154: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,732 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {7715#true} {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} #66#return; {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} is VALID [2022-04-27 10:43:54,733 INFO L290 TraceCheckUtils]: 156: Hoare triple {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} is VALID [2022-04-27 10:43:54,733 INFO L290 TraceCheckUtils]: 157: Hoare triple {7810#(and (<= 18 main_~index~0) (<= main_~index~0 18))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} is VALID [2022-04-27 10:43:54,734 INFO L290 TraceCheckUtils]: 158: Hoare triple {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} is VALID [2022-04-27 10:43:54,734 INFO L272 TraceCheckUtils]: 159: Hoare triple {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,734 INFO L290 TraceCheckUtils]: 160: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,734 INFO L290 TraceCheckUtils]: 161: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,734 INFO L290 TraceCheckUtils]: 162: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,734 INFO L284 TraceCheckUtils]: 163: Hoare quadruple {7715#true} {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} #66#return; {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} is VALID [2022-04-27 10:43:54,735 INFO L290 TraceCheckUtils]: 164: Hoare triple {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} is VALID [2022-04-27 10:43:54,735 INFO L290 TraceCheckUtils]: 165: Hoare triple {7815#(and (<= 19 main_~index~0) (<= main_~index~0 19))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} is VALID [2022-04-27 10:43:54,736 INFO L290 TraceCheckUtils]: 166: Hoare triple {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} is VALID [2022-04-27 10:43:54,736 INFO L272 TraceCheckUtils]: 167: Hoare triple {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,736 INFO L290 TraceCheckUtils]: 168: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,736 INFO L290 TraceCheckUtils]: 169: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,736 INFO L290 TraceCheckUtils]: 170: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,736 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {7715#true} {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} #66#return; {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} is VALID [2022-04-27 10:43:54,737 INFO L290 TraceCheckUtils]: 172: Hoare triple {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} is VALID [2022-04-27 10:43:54,738 INFO L290 TraceCheckUtils]: 173: Hoare triple {7820#(and (<= 20 main_~index~0) (<= main_~index~0 20))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} is VALID [2022-04-27 10:43:54,738 INFO L290 TraceCheckUtils]: 174: Hoare triple {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} is VALID [2022-04-27 10:43:54,738 INFO L272 TraceCheckUtils]: 175: Hoare triple {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,738 INFO L290 TraceCheckUtils]: 176: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,738 INFO L290 TraceCheckUtils]: 177: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,738 INFO L290 TraceCheckUtils]: 178: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,739 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {7715#true} {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} #66#return; {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} is VALID [2022-04-27 10:43:54,739 INFO L290 TraceCheckUtils]: 180: Hoare triple {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} is VALID [2022-04-27 10:43:54,740 INFO L290 TraceCheckUtils]: 181: Hoare triple {7825#(and (<= main_~index~0 21) (<= 21 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} is VALID [2022-04-27 10:43:54,740 INFO L290 TraceCheckUtils]: 182: Hoare triple {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} is VALID [2022-04-27 10:43:54,740 INFO L272 TraceCheckUtils]: 183: Hoare triple {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,740 INFO L290 TraceCheckUtils]: 184: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,740 INFO L290 TraceCheckUtils]: 185: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,740 INFO L290 TraceCheckUtils]: 186: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,740 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {7715#true} {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} #66#return; {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} is VALID [2022-04-27 10:43:54,741 INFO L290 TraceCheckUtils]: 188: Hoare triple {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} is VALID [2022-04-27 10:43:54,741 INFO L290 TraceCheckUtils]: 189: Hoare triple {7830#(and (<= main_~index~0 22) (<= 22 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} is VALID [2022-04-27 10:43:54,742 INFO L290 TraceCheckUtils]: 190: Hoare triple {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} is VALID [2022-04-27 10:43:54,742 INFO L272 TraceCheckUtils]: 191: Hoare triple {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,742 INFO L290 TraceCheckUtils]: 192: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,742 INFO L290 TraceCheckUtils]: 193: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,742 INFO L290 TraceCheckUtils]: 194: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,742 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {7715#true} {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} #66#return; {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} is VALID [2022-04-27 10:43:54,743 INFO L290 TraceCheckUtils]: 196: Hoare triple {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} is VALID [2022-04-27 10:43:54,743 INFO L290 TraceCheckUtils]: 197: Hoare triple {7835#(and (<= main_~index~0 23) (<= 23 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} is VALID [2022-04-27 10:43:54,743 INFO L290 TraceCheckUtils]: 198: Hoare triple {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} is VALID [2022-04-27 10:43:54,743 INFO L272 TraceCheckUtils]: 199: Hoare triple {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,744 INFO L290 TraceCheckUtils]: 200: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,744 INFO L290 TraceCheckUtils]: 201: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,744 INFO L290 TraceCheckUtils]: 202: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,744 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {7715#true} {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} #66#return; {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} is VALID [2022-04-27 10:43:54,744 INFO L290 TraceCheckUtils]: 204: Hoare triple {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} is VALID [2022-04-27 10:43:54,745 INFO L290 TraceCheckUtils]: 205: Hoare triple {7840#(and (<= main_~index~0 24) (<= 24 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} is VALID [2022-04-27 10:43:54,745 INFO L290 TraceCheckUtils]: 206: Hoare triple {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} is VALID [2022-04-27 10:43:54,745 INFO L272 TraceCheckUtils]: 207: Hoare triple {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,745 INFO L290 TraceCheckUtils]: 208: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,745 INFO L290 TraceCheckUtils]: 209: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,745 INFO L290 TraceCheckUtils]: 210: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,746 INFO L284 TraceCheckUtils]: 211: Hoare quadruple {7715#true} {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} #66#return; {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} is VALID [2022-04-27 10:43:54,746 INFO L290 TraceCheckUtils]: 212: Hoare triple {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} is VALID [2022-04-27 10:43:54,747 INFO L290 TraceCheckUtils]: 213: Hoare triple {7845#(and (<= main_~index~0 25) (<= 25 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} is VALID [2022-04-27 10:43:54,747 INFO L290 TraceCheckUtils]: 214: Hoare triple {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} is VALID [2022-04-27 10:43:54,747 INFO L272 TraceCheckUtils]: 215: Hoare triple {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,747 INFO L290 TraceCheckUtils]: 216: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,747 INFO L290 TraceCheckUtils]: 217: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,747 INFO L290 TraceCheckUtils]: 218: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,748 INFO L284 TraceCheckUtils]: 219: Hoare quadruple {7715#true} {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} #66#return; {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} is VALID [2022-04-27 10:43:54,748 INFO L290 TraceCheckUtils]: 220: Hoare triple {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} is VALID [2022-04-27 10:43:54,748 INFO L290 TraceCheckUtils]: 221: Hoare triple {7850#(and (<= main_~index~0 26) (<= 26 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} is VALID [2022-04-27 10:43:54,749 INFO L290 TraceCheckUtils]: 222: Hoare triple {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} is VALID [2022-04-27 10:43:54,749 INFO L272 TraceCheckUtils]: 223: Hoare triple {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,749 INFO L290 TraceCheckUtils]: 224: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,749 INFO L290 TraceCheckUtils]: 225: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,749 INFO L290 TraceCheckUtils]: 226: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,749 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {7715#true} {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} #66#return; {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} is VALID [2022-04-27 10:43:54,750 INFO L290 TraceCheckUtils]: 228: Hoare triple {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} is VALID [2022-04-27 10:43:54,750 INFO L290 TraceCheckUtils]: 229: Hoare triple {7855#(and (<= 27 main_~index~0) (<= main_~index~0 27))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} is VALID [2022-04-27 10:43:54,750 INFO L290 TraceCheckUtils]: 230: Hoare triple {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} is VALID [2022-04-27 10:43:54,751 INFO L272 TraceCheckUtils]: 231: Hoare triple {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,751 INFO L290 TraceCheckUtils]: 232: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,751 INFO L290 TraceCheckUtils]: 233: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,751 INFO L290 TraceCheckUtils]: 234: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,751 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {7715#true} {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} #66#return; {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} is VALID [2022-04-27 10:43:54,751 INFO L290 TraceCheckUtils]: 236: Hoare triple {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} is VALID [2022-04-27 10:43:54,752 INFO L290 TraceCheckUtils]: 237: Hoare triple {7860#(and (<= 28 main_~index~0) (<= main_~index~0 28))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} is VALID [2022-04-27 10:43:54,752 INFO L290 TraceCheckUtils]: 238: Hoare triple {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} is VALID [2022-04-27 10:43:54,752 INFO L272 TraceCheckUtils]: 239: Hoare triple {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,752 INFO L290 TraceCheckUtils]: 240: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,752 INFO L290 TraceCheckUtils]: 241: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,752 INFO L290 TraceCheckUtils]: 242: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,753 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {7715#true} {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} #66#return; {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} is VALID [2022-04-27 10:43:54,753 INFO L290 TraceCheckUtils]: 244: Hoare triple {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} is VALID [2022-04-27 10:43:54,754 INFO L290 TraceCheckUtils]: 245: Hoare triple {7865#(and (<= main_~index~0 29) (<= 29 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {7870#(and (<= main_~index~0 30) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:43:54,754 INFO L290 TraceCheckUtils]: 246: Hoare triple {7870#(and (<= main_~index~0 30) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {7716#false} is VALID [2022-04-27 10:43:54,754 INFO L290 TraceCheckUtils]: 247: Hoare triple {7716#false} ~index~0 := 0; {7716#false} is VALID [2022-04-27 10:43:54,754 INFO L290 TraceCheckUtils]: 248: Hoare triple {7716#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7716#false} is VALID [2022-04-27 10:43:54,754 INFO L272 TraceCheckUtils]: 249: Hoare triple {7716#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 250: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 251: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 252: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,755 INFO L284 TraceCheckUtils]: 253: Hoare quadruple {7715#true} {7716#false} #68#return; {7716#false} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 254: Hoare triple {7716#false} havoc #t~mem4; {7716#false} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 255: Hoare triple {7716#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {7716#false} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 256: Hoare triple {7716#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7716#false} is VALID [2022-04-27 10:43:54,755 INFO L272 TraceCheckUtils]: 257: Hoare triple {7716#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 258: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,755 INFO L290 TraceCheckUtils]: 259: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 260: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,756 INFO L284 TraceCheckUtils]: 261: Hoare quadruple {7715#true} {7716#false} #68#return; {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 262: Hoare triple {7716#false} havoc #t~mem4; {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 263: Hoare triple {7716#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 264: Hoare triple {7716#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L272 TraceCheckUtils]: 265: Hoare triple {7716#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7715#true} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 266: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 267: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 268: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-27 10:43:54,756 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {7715#true} {7716#false} #68#return; {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 270: Hoare triple {7716#false} havoc #t~mem4; {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 271: Hoare triple {7716#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {7716#false} is VALID [2022-04-27 10:43:54,756 INFO L290 TraceCheckUtils]: 272: Hoare triple {7716#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {7716#false} is VALID [2022-04-27 10:43:54,757 INFO L272 TraceCheckUtils]: 273: Hoare triple {7716#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {7716#false} is VALID [2022-04-27 10:43:54,757 INFO L290 TraceCheckUtils]: 274: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-27 10:43:54,757 INFO L290 TraceCheckUtils]: 275: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-27 10:43:54,757 INFO L290 TraceCheckUtils]: 276: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-27 10:43:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3546 backedges. 6 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2022-04-27 10:43:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:43:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723572148] [2022-04-27 10:43:54,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723572148] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:43:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064311232] [2022-04-27 10:43:54,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:43:54,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:43:54,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:43:54,764 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-04-27 10:43:54,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process