/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-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:53:29,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:53:29,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:53:29,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:53:29,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:53:29,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:53:29,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:53:29,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:53:29,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:53:29,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:53:29,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:53:29,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:53:29,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:53:29,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:53:29,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:53:29,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:53:29,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:53:29,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:53:29,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:53:29,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:53:29,890 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:53:29,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:53:29,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:53:29,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:53:29,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:53:29,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:53:29,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:53:29,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:53:29,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:53:29,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:53:29,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:53:29,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:53:29,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:53:29,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:53:29,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:53:29,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:53:29,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:53:29,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:53:29,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:53:29,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:53:29,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:53:29,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:53:29,906 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:53:29,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:53:29,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:53:29,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:53:29,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:53:29,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:53:29,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:53:29,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:53:29,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:53:29,933 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:53:29,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:53:29,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:53:29,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:53:29,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:53:29,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:53:29,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:53:29,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:53:29,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:29,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:53:29,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:53:29,936 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:53:30,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:53:30,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:53:30,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:53:30,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:53:30,190 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:53:30,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-27 10:53:30,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6eac6249/c73a1e12b268485a9f180e407adf3944/FLAGc6ff1efb3 [2022-04-27 10:53:30,618 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:53:30,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-27 10:53:30,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6eac6249/c73a1e12b268485a9f180e407adf3944/FLAGc6ff1efb3 [2022-04-27 10:53:31,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6eac6249/c73a1e12b268485a9f180e407adf3944 [2022-04-27 10:53:31,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:53:31,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:53:31,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:31,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:53:31,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:53:31,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56710151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31, skipping insertion in model container [2022-04-27 10:53:31,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:53:31,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:53:31,179 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-lit/mcmillan2006.i[1009,1022] [2022-04-27 10:53:31,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:31,223 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:53:31,239 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-lit/mcmillan2006.i[1009,1022] [2022-04-27 10:53:31,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:31,262 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:53:31,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31 WrapperNode [2022-04-27 10:53:31,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:31,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:53:31,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:53:31,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:53:31,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:53:31,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:53:31,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:53:31,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:53:31,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (1/1) ... [2022-04-27 10:53:31,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:31,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:31,346 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:53:31,364 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:53:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:53:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:53:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:53:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:53:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:53:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:53:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 10:53:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:53:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:53:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:53:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:53:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:53:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:53:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:53:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:53:31,442 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:53:31,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:53:31,638 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:53:31,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:53:31,644 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:53:31,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:31 BoogieIcfgContainer [2022-04-27 10:53:31,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:53:31,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:53:31,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:53:31,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:53:31,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:53:31" (1/3) ... [2022-04-27 10:53:31,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f42e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:31, skipping insertion in model container [2022-04-27 10:53:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:31" (2/3) ... [2022-04-27 10:53:31,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f42e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:31, skipping insertion in model container [2022-04-27 10:53:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:31" (3/3) ... [2022-04-27 10:53:31,664 INFO L111 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2022-04-27 10:53:31,677 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:53:31,677 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:53:31,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:53:31,728 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@2d02fc6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d4b2267 [2022-04-27 10:53:31,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:53:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:53:31,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:31,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:31,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 1 times [2022-04-27 10:53:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:31,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356225885] [2022-04-27 10:53:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:32,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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(9, 2); {28#true} is VALID [2022-04-27 10:53:32,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 10:53:32,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-27 10:53:32,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:32,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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(9, 2); {28#true} is VALID [2022-04-27 10:53:32,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 10:53:32,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-27 10:53:32,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-27 10:53:32,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2022-04-27 10:53:32,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {33#(= main_~i~0 0)} is VALID [2022-04-27 10:53:32,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {34#(<= main_~n~0 0)} is VALID [2022-04-27 10:53:32,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#(<= main_~n~0 0)} ~i~1 := 0; {35#(and (<= main_~n~0 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:32,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#(and (<= main_~n~0 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29#false} is VALID [2022-04-27 10:53:32,066 INFO L272 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29#false} is VALID [2022-04-27 10:53:32,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-27 10:53:32,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-27 10:53:32,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 10:53:32,067 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:53:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356225885] [2022-04-27 10:53:32,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356225885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:32,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:32,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:53:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946353389] [2022-04-27 10:53:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-27 10:53:32,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:32,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:53:32,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:32,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:53:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:53:32,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:53:32,137 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:53:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:32,375 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-27 10:53:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:53:32,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-27 10:53:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:53:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-27 10:53:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:53:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-27 10:53:32,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-27 10:53:32,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:32,450 INFO L225 Difference]: With dead ends: 48 [2022-04-27 10:53:32,450 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:53:32,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:53:32,455 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:32,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:53:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 10:53:32,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:32,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:53:32,481 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:53:32,481 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:53:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:32,484 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:53:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:53:32,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:32,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:32,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 10:53:32,485 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 10:53:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:32,487 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:53:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:53:32,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:32,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:32,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:32,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:53:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-27 10:53:32,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-27 10:53:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:32,492 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-27 10:53:32,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:53:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 10:53:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:53:32,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:32,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:32,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:53:32,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 1 times [2022-04-27 10:53:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:32,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227652699] [2022-04-27 10:53:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:32,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:32,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#(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(9, 2); {180#true} is VALID [2022-04-27 10:53:32,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-27 10:53:32,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #70#return; {180#true} is VALID [2022-04-27 10:53:32,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:32,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(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(9, 2); {180#true} is VALID [2022-04-27 10:53:32,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-27 10:53:32,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #70#return; {180#true} is VALID [2022-04-27 10:53:32,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret6 := main(); {180#true} is VALID [2022-04-27 10:53:32,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {180#true} is VALID [2022-04-27 10:53:32,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {185#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-27 10:53:32,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {186#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-27 10:53:32,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-27 10:53:32,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-27 10:53:32,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {188#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:32,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {189#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:32,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {189#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:32,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {190#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {191#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:32,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {191#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-27 10:53:32,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-27 10:53:32,767 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:53:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:32,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227652699] [2022-04-27 10:53:32,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227652699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:32,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566932085] [2022-04-27 10:53:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:32,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:32,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:32,775 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:53:32,801 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:53:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:32,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 10:53:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:32,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:32,954 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 11 treesize of output 7 [2022-04-27 10:53:33,049 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 7 [2022-04-27 10:53:33,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-27 10:53:33,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(9, 2); {180#true} is VALID [2022-04-27 10:53:33,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-27 10:53:33,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #70#return; {180#true} is VALID [2022-04-27 10:53:33,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret6 := main(); {180#true} is VALID [2022-04-27 10:53:33,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {180#true} is VALID [2022-04-27 10:53:33,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {185#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-27 10:53:33,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-27 10:53:33,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-27 10:53:33,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-27 10:53:33,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {188#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:33,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {189#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:33,124 INFO L272 TraceCheckUtils]: 12: Hoare triple {189#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:33,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:33,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-27 10:53:33,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-27 10:53:33,128 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:53:33,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:33,270 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 14 treesize of output 12 [2022-04-27 10:53:33,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-04-27 10:53:33,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-27 10:53:33,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-27 10:53:33,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:33,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {189#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:33,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {189#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:33,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {259#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} ~i~1 := 0; {255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:53:33,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} assume !(~i~0 < ~n~0); {259#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-27 10:53:33,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {259#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-27 10:53:33,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(= 0 (* main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {259#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-27 10:53:33,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {269#(= 0 (* main_~i~0 4))} is VALID [2022-04-27 10:53:33,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {180#true} is VALID [2022-04-27 10:53:33,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret6 := main(); {180#true} is VALID [2022-04-27 10:53:33,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #70#return; {180#true} is VALID [2022-04-27 10:53:33,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-27 10:53:33,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(9, 2); {180#true} is VALID [2022-04-27 10:53:33,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-27 10:53:33,328 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:53:33,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566932085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:33,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:33,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-04-27 10:53:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731721433] [2022-04-27 10:53:33,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:33,333 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:53:33,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:33,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:33,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:33,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:53:33,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:53:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:53:33,360 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:33,742 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 10:53:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:53:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:53:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-27 10:53:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-27 10:53:33,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-27 10:53:33,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:33,786 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:53:33,787 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:53:33,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:53:33,790 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:33,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 44 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:53:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-27 10:53:33,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:33,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:33,798 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:33,798 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:33,800 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 10:53:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-27 10:53:33,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:33,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:33,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-27 10:53:33,801 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-27 10:53:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:33,803 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 10:53:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-27 10:53:33,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:33,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:33,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:33,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-27 10:53:33,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2022-04-27 10:53:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:33,807 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-27 10:53:33,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 10:53:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 10:53:33,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:33,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:33,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:53:34,029 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:53:34,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 1 times [2022-04-27 10:53:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204874714] [2022-04-27 10:53:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:34,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#(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(9, 2); {452#true} is VALID [2022-04-27 10:53:34,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} #70#return; {452#true} is VALID [2022-04-27 10:53:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:53:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:34,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 10:53:34,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 10:53:34,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {460#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {460#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-27 10:53:34,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:34,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(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(9, 2); {452#true} is VALID [2022-04-27 10:53:34,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #70#return; {452#true} is VALID [2022-04-27 10:53:34,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret6 := main(); {452#true} is VALID [2022-04-27 10:53:34,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {452#true} is VALID [2022-04-27 10:53:34,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {457#(= main_~i~0 0)} is VALID [2022-04-27 10:53:34,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {457#(= main_~i~0 0)} is VALID [2022-04-27 10:53:34,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {458#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:34,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {459#(<= main_~n~0 1)} is VALID [2022-04-27 10:53:34,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= main_~n~0 1)} ~i~1 := 0; {460#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-27 10:53:34,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(and (<= main_~n~0 1) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {460#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-27 10:53:34,146 INFO L272 TraceCheckUtils]: 12: Hoare triple {460#(and (<= main_~n~0 1) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {452#true} is VALID [2022-04-27 10:53:34,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 10:53:34,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 10:53:34,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,148 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {452#true} {460#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {460#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-27 10:53:34,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#(and (<= main_~n~0 1) (= main_~i~1 0))} havoc #t~mem5; {460#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-27 10:53:34,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#(and (<= main_~n~0 1) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {465#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 10:53:34,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {465#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {453#false} is VALID [2022-04-27 10:53:34,150 INFO L272 TraceCheckUtils]: 20: Hoare triple {453#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {453#false} is VALID [2022-04-27 10:53:34,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {453#false} ~cond := #in~cond; {453#false} is VALID [2022-04-27 10:53:34,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} assume 0 == ~cond; {453#false} is VALID [2022-04-27 10:53:34,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 10:53:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:34,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:34,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204874714] [2022-04-27 10:53:34,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204874714] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:34,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716771074] [2022-04-27 10:53:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:34,153 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:53:34,154 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:53:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:34,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:53:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:34,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:34,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 10:53:34,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#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(9, 2); {452#true} is VALID [2022-04-27 10:53:34,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #70#return; {452#true} is VALID [2022-04-27 10:53:34,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret6 := main(); {452#true} is VALID [2022-04-27 10:53:34,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {452#true} is VALID [2022-04-27 10:53:34,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {488#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:34,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {488#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:34,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {458#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:34,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {459#(<= main_~n~0 1)} is VALID [2022-04-27 10:53:34,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= main_~n~0 1)} ~i~1 := 0; {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-27 10:53:34,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-27 10:53:34,399 INFO L272 TraceCheckUtils]: 12: Hoare triple {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {452#true} is VALID [2022-04-27 10:53:34,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 10:53:34,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 10:53:34,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,400 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {452#true} {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #68#return; {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-27 10:53:34,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} havoc #t~mem5; {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-27 10:53:34,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {501#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {526#(and (<= 1 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-27 10:53:34,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#(and (<= 1 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {453#false} is VALID [2022-04-27 10:53:34,402 INFO L272 TraceCheckUtils]: 20: Hoare triple {453#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {453#false} is VALID [2022-04-27 10:53:34,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {453#false} ~cond := #in~cond; {453#false} is VALID [2022-04-27 10:53:34,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} assume 0 == ~cond; {453#false} is VALID [2022-04-27 10:53:34,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 10:53:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:34,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:34,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 10:53:34,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} assume 0 == ~cond; {453#false} is VALID [2022-04-27 10:53:34,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {453#false} ~cond := #in~cond; {453#false} is VALID [2022-04-27 10:53:34,525 INFO L272 TraceCheckUtils]: 20: Hoare triple {453#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {453#false} is VALID [2022-04-27 10:53:34,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {465#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {453#false} is VALID [2022-04-27 10:53:34,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {465#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 10:53:34,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {557#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {557#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:34,536 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {452#true} {557#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {557#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:34,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 10:53:34,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 10:53:34,537 INFO L272 TraceCheckUtils]: 12: Hoare triple {557#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {452#true} is VALID [2022-04-27 10:53:34,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {557#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {557#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:34,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= main_~n~0 1)} ~i~1 := 0; {557#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:34,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {459#(<= main_~n~0 1)} is VALID [2022-04-27 10:53:34,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {458#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:34,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {488#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:34,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {488#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:34,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {452#true} is VALID [2022-04-27 10:53:34,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret6 := main(); {452#true} is VALID [2022-04-27 10:53:34,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #70#return; {452#true} is VALID [2022-04-27 10:53:34,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 10:53:34,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#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(9, 2); {452#true} is VALID [2022-04-27 10:53:34,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 10:53:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:34,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716771074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:34,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:34,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:53:34,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137089095] [2022-04-27 10:53:34,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2022-04-27 10:53:34,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:34,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:34,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:34,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:53:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:34,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:53:34,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:53:34,596 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:34,906 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-27 10:53:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:53:34,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2022-04-27 10:53:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 10:53:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 10:53:34,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 10:53:34,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:34,945 INFO L225 Difference]: With dead ends: 46 [2022-04-27 10:53:34,945 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:53:34,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:53:34,947 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:34,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:53:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-27 10:53:34,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:34,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:34,953 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:34,954 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:34,956 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 10:53:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-27 10:53:34,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:34,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:34,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-27 10:53:34,957 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-27 10:53:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:34,958 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 10:53:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-27 10:53:34,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:34,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:34,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:34,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:53:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 10:53:34,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2022-04-27 10:53:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:34,961 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 10:53:34,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 10:53:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:53:34,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:34,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:34,990 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:53:35,162 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:53:35,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 2 times [2022-04-27 10:53:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995216638] [2022-04-27 10:53:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:35,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#(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(9, 2); {791#true} is VALID [2022-04-27 10:53:35,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:35,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {791#true} {791#true} #70#return; {791#true} is VALID [2022-04-27 10:53:35,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 10:53:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:35,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#true} ~cond := #in~cond; {791#true} is VALID [2022-04-27 10:53:35,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {791#true} assume !(0 == ~cond); {791#true} is VALID [2022-04-27 10:53:35,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:35,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {791#true} {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:35,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {791#true} call ULTIMATE.init(); {809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:35,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#(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(9, 2); {791#true} is VALID [2022-04-27 10:53:35,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:35,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {791#true} {791#true} #70#return; {791#true} is VALID [2022-04-27 10:53:35,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {791#true} call #t~ret6 := main(); {791#true} is VALID [2022-04-27 10:53:35,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {791#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {791#true} is VALID [2022-04-27 10:53:35,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {791#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {796#(= main_~i~0 0)} is VALID [2022-04-27 10:53:35,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {796#(= main_~i~0 0)} is VALID [2022-04-27 10:53:35,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {797#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:35,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {798#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:35,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {798#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:35,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:35,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:35,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:35,330 INFO L272 TraceCheckUtils]: 14: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {791#true} is VALID [2022-04-27 10:53:35,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {791#true} ~cond := #in~cond; {791#true} is VALID [2022-04-27 10:53:35,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#true} assume !(0 == ~cond); {791#true} is VALID [2022-04-27 10:53:35,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:35,331 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {791#true} {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:35,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:35,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {805#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:53:35,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {805#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {806#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:35,333 INFO L272 TraceCheckUtils]: 22: Hoare triple {806#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {807#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:35,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {807#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {808#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:35,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {808#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {792#false} is VALID [2022-04-27 10:53:35,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {792#false} assume !false; {792#false} is VALID [2022-04-27 10:53:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:35,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:35,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995216638] [2022-04-27 10:53:35,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995216638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:35,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665407636] [2022-04-27 10:53:35,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:53:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:35,340 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:53:35,341 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:53:35,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:53:35,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:53:35,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 10:53:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:35,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:35,462 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:53:37,824 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 19 treesize of output 7 [2022-04-27 10:53:37,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {791#true} call ULTIMATE.init(); {791#true} is VALID [2022-04-27 10:53:37,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {791#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(9, 2); {791#true} is VALID [2022-04-27 10:53:37,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:37,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {791#true} {791#true} #70#return; {791#true} is VALID [2022-04-27 10:53:37,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {791#true} call #t~ret6 := main(); {791#true} is VALID [2022-04-27 10:53:37,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {791#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {791#true} is VALID [2022-04-27 10:53:37,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {791#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {796#(= main_~i~0 0)} is VALID [2022-04-27 10:53:37,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {796#(= main_~i~0 0)} is VALID [2022-04-27 10:53:37,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {797#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:37,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:37,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:37,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:37,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:37,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:37,883 INFO L272 TraceCheckUtils]: 14: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} is VALID [2022-04-27 10:53:37,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} ~cond := #in~cond; {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} is VALID [2022-04-27 10:53:37,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} assume !(0 == ~cond); {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} is VALID [2022-04-27 10:53:37,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} assume true; {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} is VALID [2022-04-27 10:53:37,885 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {855#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ 4 v_main_~x~0.offset_BEFORE_CALL_1)) 0))} {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:37,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:37,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {800#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {874#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:53:37,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {874#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {806#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:37,891 INFO L272 TraceCheckUtils]: 22: Hoare triple {806#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:37,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:37,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {792#false} is VALID [2022-04-27 10:53:37,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {792#false} assume !false; {792#false} is VALID [2022-04-27 10:53:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:37,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:40,062 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:53:40,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:53:40,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {792#false} assume !false; {792#false} is VALID [2022-04-27 10:53:40,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {792#false} is VALID [2022-04-27 10:53:40,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:40,119 INFO L272 TraceCheckUtils]: 22: Hoare triple {806#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:40,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {805#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {806#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:40,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {805#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:53:40,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:40,122 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {791#true} {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:40,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:40,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#true} assume !(0 == ~cond); {791#true} is VALID [2022-04-27 10:53:40,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {791#true} ~cond := #in~cond; {791#true} is VALID [2022-04-27 10:53:40,122 INFO L272 TraceCheckUtils]: 14: Hoare triple {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {791#true} is VALID [2022-04-27 10:53:40,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:40,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {907#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:40,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:40,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:40,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {799#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:40,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {797#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:40,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {796#(= main_~i~0 0)} is VALID [2022-04-27 10:53:40,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {791#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {796#(= main_~i~0 0)} is VALID [2022-04-27 10:53:40,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {791#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {791#true} is VALID [2022-04-27 10:53:40,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {791#true} call #t~ret6 := main(); {791#true} is VALID [2022-04-27 10:53:40,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {791#true} {791#true} #70#return; {791#true} is VALID [2022-04-27 10:53:40,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#true} assume true; {791#true} is VALID [2022-04-27 10:53:40,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {791#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(9, 2); {791#true} is VALID [2022-04-27 10:53:40,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {791#true} call ULTIMATE.init(); {791#true} is VALID [2022-04-27 10:53:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:40,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665407636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:40,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:40,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 17 [2022-04-27 10:53:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170254657] [2022-04-27 10:53:40,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:40,129 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-04-27 10:53:40,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:40,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:40,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:40,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 10:53:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 10:53:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2022-04-27 10:53:40,179 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:49,040 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 10:53:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 10:53:49,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-04-27 10:53:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-27 10:53:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-27 10:53:49,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-27 10:53:49,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:49,093 INFO L225 Difference]: With dead ends: 50 [2022-04-27 10:53:49,093 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 10:53:49,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=126, Invalid=680, Unknown=6, NotChecked=0, Total=812 [2022-04-27 10:53:49,094 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:49,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-04-27 10:53:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 10:53:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-04-27 10:53:49,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:49,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:49,103 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:49,103 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:49,107 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-27 10:53:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-27 10:53:49,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:49,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:49,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-04-27 10:53:49,108 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-04-27 10:53:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:49,111 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-27 10:53:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-27 10:53:49,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:49,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:49,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:49,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-27 10:53:49,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 26 [2022-04-27 10:53:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:49,113 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-27 10:53:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-27 10:53:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:53:49,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:49,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:49,133 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:53:49,314 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:53:49,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1812006654, now seen corresponding path program 3 times [2022-04-27 10:53:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:49,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171862226] [2022-04-27 10:53:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:49,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {1237#(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(9, 2); {1218#true} is VALID [2022-04-27 10:53:49,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:49,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1218#true} {1218#true} #70#return; {1218#true} is VALID [2022-04-27 10:53:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:53:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:49,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {1218#true} ~cond := #in~cond; {1218#true} is VALID [2022-04-27 10:53:49,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#true} assume !(0 == ~cond); {1218#true} is VALID [2022-04-27 10:53:49,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:49,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1218#true} {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:49,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {1218#true} call ULTIMATE.init(); {1237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:49,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#(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(9, 2); {1218#true} is VALID [2022-04-27 10:53:49,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:49,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1218#true} {1218#true} #70#return; {1218#true} is VALID [2022-04-27 10:53:49,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {1218#true} call #t~ret6 := main(); {1218#true} is VALID [2022-04-27 10:53:49,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {1218#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1218#true} is VALID [2022-04-27 10:53:49,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {1218#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1223#(= main_~i~0 0)} is VALID [2022-04-27 10:53:49,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1223#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1223#(= main_~i~0 0)} is VALID [2022-04-27 10:53:49,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {1223#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1224#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:49,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1225#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:49,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1226#(and (not (= (+ main_~x~0.offset 4) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} is VALID [2022-04-27 10:53:49,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {1226#(and (not (= (+ main_~x~0.offset 4) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:49,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:49,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:49,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:49,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:49,523 INFO L272 TraceCheckUtils]: 16: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1218#true} is VALID [2022-04-27 10:53:49,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {1218#true} ~cond := #in~cond; {1218#true} is VALID [2022-04-27 10:53:49,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {1218#true} assume !(0 == ~cond); {1218#true} is VALID [2022-04-27 10:53:49,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:49,524 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1218#true} {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:49,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:49,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1233#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:53:49,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {1233#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1234#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:49,526 INFO L272 TraceCheckUtils]: 24: Hoare triple {1234#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:49,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {1235#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1236#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:49,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {1236#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1219#false} is VALID [2022-04-27 10:53:49,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {1219#false} assume !false; {1219#false} is VALID [2022-04-27 10:53:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171862226] [2022-04-27 10:53:49,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171862226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100463507] [2022-04-27 10:53:49,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:53:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:49,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:49,529 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:53:49,530 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:53:49,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 10:53:49,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:53:49,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:53:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:49,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:49,674 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:53:49,738 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 10:53:49,738 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 25 treesize of output 24 [2022-04-27 10:53:51,988 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 19 treesize of output 7 [2022-04-27 10:53:52,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {1218#true} call ULTIMATE.init(); {1218#true} is VALID [2022-04-27 10:53:52,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#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(9, 2); {1218#true} is VALID [2022-04-27 10:53:52,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:52,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1218#true} {1218#true} #70#return; {1218#true} is VALID [2022-04-27 10:53:52,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {1218#true} call #t~ret6 := main(); {1218#true} is VALID [2022-04-27 10:53:52,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {1218#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1218#true} is VALID [2022-04-27 10:53:52,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {1218#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1223#(= main_~i~0 0)} is VALID [2022-04-27 10:53:52,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {1223#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1223#(= main_~i~0 0)} is VALID [2022-04-27 10:53:52,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {1223#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1224#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:52,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:52,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:52,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:52,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:52,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:52,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:52,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:52,039 INFO L272 TraceCheckUtils]: 16: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} is VALID [2022-04-27 10:53:52,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} ~cond := #in~cond; {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} is VALID [2022-04-27 10:53:52,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} assume !(0 == ~cond); {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} is VALID [2022-04-27 10:53:52,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} assume true; {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} is VALID [2022-04-27 10:53:52,041 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1289#(exists ((v_main_~x~0.offset_BEFORE_CALL_3 Int) (v_main_~x~0.base_BEFORE_CALL_3 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_3) (+ 4 v_main_~x~0.offset_BEFORE_CALL_3)) 0))} {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:52,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:52,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {1228#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:53:52,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {1308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1234#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:52,053 INFO L272 TraceCheckUtils]: 24: Hoare triple {1234#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1315#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:52,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {1315#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1319#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:52,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {1319#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1219#false} is VALID [2022-04-27 10:53:52,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {1219#false} assume !false; {1219#false} is VALID [2022-04-27 10:53:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:53:52,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:54,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 4)) 0)) is different from false [2022-04-27 10:53:54,613 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 23 treesize of output 21 [2022-04-27 10:53:54,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-04-27 10:53:54,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {1219#false} assume !false; {1219#false} is VALID [2022-04-27 10:53:54,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {1319#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1219#false} is VALID [2022-04-27 10:53:54,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {1315#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1319#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:54,665 INFO L272 TraceCheckUtils]: 24: Hoare triple {1234#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1315#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:54,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {1233#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1234#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:54,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1233#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:53:54,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:54,667 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1218#true} {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:54,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:54,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {1218#true} assume !(0 == ~cond); {1218#true} is VALID [2022-04-27 10:53:54,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {1218#true} ~cond := #in~cond; {1218#true} is VALID [2022-04-27 10:53:54,667 INFO L272 TraceCheckUtils]: 16: Hoare triple {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1218#true} is VALID [2022-04-27 10:53:54,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:54,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {1341#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:54,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:54,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:54,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {1375#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 4)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1227#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-27 10:53:54,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {1375#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 4)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1375#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 4)) 0))} is VALID [2022-04-27 10:53:54,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1375#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 4)) 0))} is VALID [2022-04-27 10:53:54,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {1223#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1224#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:54,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {1223#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1223#(= main_~i~0 0)} is VALID [2022-04-27 10:53:54,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {1218#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1223#(= main_~i~0 0)} is VALID [2022-04-27 10:53:54,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {1218#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1218#true} is VALID [2022-04-27 10:53:54,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {1218#true} call #t~ret6 := main(); {1218#true} is VALID [2022-04-27 10:53:54,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1218#true} {1218#true} #70#return; {1218#true} is VALID [2022-04-27 10:53:54,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {1218#true} assume true; {1218#true} is VALID [2022-04-27 10:53:54,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1218#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(9, 2); {1218#true} is VALID [2022-04-27 10:53:54,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {1218#true} call ULTIMATE.init(); {1218#true} is VALID [2022-04-27 10:53:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-04-27 10:53:54,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100463507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:54,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:54,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 19 [2022-04-27 10:53:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476498687] [2022-04-27 10:53:54,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:54,684 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 10:53:54,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:54,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:54,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:54,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:53:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:54,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:53:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=258, Unknown=3, NotChecked=32, Total=342 [2022-04-27 10:53:54,723 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:55,232 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 4)) 0)) (= (select (select |c_#memory_int| c_main_~x~0.base) (+ (* c_main_~i~0 4) c_main_~x~0.offset)) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 10:53:55,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0.offset 4))) (and (= (select (select |c_#memory_int| c_main_~x~0.base) .cse0) 0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 4)) 0)) (not (= .cse0 (+ (* c_main_~i~0 4) c_main_~x~0.offset))))) is different from false [2022-04-27 10:53:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:56,056 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-27 10:53:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:53:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 10:53:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-27 10:53:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-27 10:53:56,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 47 transitions. [2022-04-27 10:53:56,109 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:53:56,111 INFO L225 Difference]: With dead ends: 59 [2022-04-27 10:53:56,111 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 10:53:56,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=118, Invalid=645, Unknown=5, NotChecked=162, Total=930 [2022-04-27 10:53:56,112 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:56,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 97 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 233 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2022-04-27 10:53:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 10:53:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2022-04-27 10:53:56,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:56,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:56,125 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:56,125 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:56,127 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 10:53:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 10:53:56,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:56,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:56,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 57 states. [2022-04-27 10:53:56,128 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 57 states. [2022-04-27 10:53:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:56,130 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 10:53:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 10:53:56,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:56,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:56,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:56,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-27 10:53:56,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-27 10:53:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:56,132 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-27 10:53:56,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:53:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-27 10:53:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 10:53:56,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:56,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:56,155 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:53:56,351 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:53:56,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 4 times [2022-04-27 10:53:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:56,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269771490] [2022-04-27 10:53:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:56,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {1705#(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(9, 2); {1685#true} is VALID [2022-04-27 10:53:56,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1685#true} {1685#true} #70#return; {1685#true} is VALID [2022-04-27 10:53:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 10:53:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:56,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:56,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:56,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-27 10:53:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 10:53:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:56,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:56,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:56,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1699#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:56,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:56,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#(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(9, 2); {1685#true} is VALID [2022-04-27 10:53:56,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #70#return; {1685#true} is VALID [2022-04-27 10:53:56,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret6 := main(); {1685#true} is VALID [2022-04-27 10:53:56,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1685#true} is VALID [2022-04-27 10:53:56,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1690#(= main_~i~0 0)} is VALID [2022-04-27 10:53:56,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1690#(= main_~i~0 0)} is VALID [2022-04-27 10:53:56,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1691#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:56,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1691#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:56,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1692#(<= main_~i~0 2)} is VALID [2022-04-27 10:53:56,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1693#(<= main_~n~0 2)} is VALID [2022-04-27 10:53:56,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#(<= main_~n~0 2)} ~i~1 := 0; {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-27 10:53:56,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-27 10:53:56,462 INFO L272 TraceCheckUtils]: 14: Hoare triple {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1685#true} is VALID [2022-04-27 10:53:56,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:56,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:56,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,463 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1685#true} {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-27 10:53:56,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} havoc #t~mem5; {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-27 10:53:56,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {1694#(and (<= main_~n~0 2) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:56,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:56,464 INFO L272 TraceCheckUtils]: 22: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1685#true} is VALID [2022-04-27 10:53:56,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:56,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:56,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,465 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1685#true} {1699#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:56,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:56,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1704#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 10:53:56,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {1704#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1686#false} is VALID [2022-04-27 10:53:56,466 INFO L272 TraceCheckUtils]: 30: Hoare triple {1686#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1686#false} is VALID [2022-04-27 10:53:56,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2022-04-27 10:53:56,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#false} assume 0 == ~cond; {1686#false} is VALID [2022-04-27 10:53:56,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2022-04-27 10:53:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:53:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:56,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269771490] [2022-04-27 10:53:56,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269771490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:56,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862219937] [2022-04-27 10:53:56,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:53:56,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:56,469 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:53:56,480 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:53:56,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:53:56,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:53:56,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:53:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:56,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:56,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2022-04-27 10:53:56,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#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(9, 2); {1685#true} is VALID [2022-04-27 10:53:56,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #70#return; {1685#true} is VALID [2022-04-27 10:53:56,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret6 := main(); {1685#true} is VALID [2022-04-27 10:53:56,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1685#true} is VALID [2022-04-27 10:53:56,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1727#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:56,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1727#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1727#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:56,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1691#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:56,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1691#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:56,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1692#(<= main_~i~0 2)} is VALID [2022-04-27 10:53:56,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1693#(<= main_~n~0 2)} is VALID [2022-04-27 10:53:56,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#(<= main_~n~0 2)} ~i~1 := 0; {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-27 10:53:56,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-27 10:53:56,804 INFO L272 TraceCheckUtils]: 14: Hoare triple {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1685#true} is VALID [2022-04-27 10:53:56,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:56,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:56,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,809 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1685#true} {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #68#return; {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-27 10:53:56,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} havoc #t~mem5; {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-27 10:53:56,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {1746#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-27 10:53:56,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-27 10:53:56,812 INFO L272 TraceCheckUtils]: 22: Hoare triple {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1685#true} is VALID [2022-04-27 10:53:56,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:56,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:56,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:56,813 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1685#true} {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #68#return; {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-27 10:53:56,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} havoc #t~mem5; {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-27 10:53:56,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {1771#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1796#(and (<= main_~n~0 2) (<= 2 main_~i~1))} is VALID [2022-04-27 10:53:56,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {1796#(and (<= main_~n~0 2) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1686#false} is VALID [2022-04-27 10:53:56,815 INFO L272 TraceCheckUtils]: 30: Hoare triple {1686#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1686#false} is VALID [2022-04-27 10:53:56,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2022-04-27 10:53:56,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#false} assume 0 == ~cond; {1686#false} is VALID [2022-04-27 10:53:56,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2022-04-27 10:53:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:53:56,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:57,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2022-04-27 10:53:57,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#false} assume 0 == ~cond; {1686#false} is VALID [2022-04-27 10:53:57,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2022-04-27 10:53:57,010 INFO L272 TraceCheckUtils]: 30: Hoare triple {1686#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1686#false} is VALID [2022-04-27 10:53:57,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {1704#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1686#false} is VALID [2022-04-27 10:53:57,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1704#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 10:53:57,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:57,012 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1685#true} {1699#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:57,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:57,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:57,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:57,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1685#true} is VALID [2022-04-27 10:53:57,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {1699#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:57,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {1851#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1699#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:53:57,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {1851#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {1851#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:53:57,015 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1685#true} {1851#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {1851#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:53:57,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:57,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#true} assume !(0 == ~cond); {1685#true} is VALID [2022-04-27 10:53:57,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#true} ~cond := #in~cond; {1685#true} is VALID [2022-04-27 10:53:57,015 INFO L272 TraceCheckUtils]: 14: Hoare triple {1851#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1685#true} is VALID [2022-04-27 10:53:57,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1851#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1851#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:53:57,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#(<= main_~n~0 2)} ~i~1 := 0; {1851#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:53:57,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1693#(<= main_~n~0 2)} is VALID [2022-04-27 10:53:57,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1692#(<= main_~i~0 2)} is VALID [2022-04-27 10:53:57,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1691#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:57,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1691#(<= main_~i~0 1)} is VALID [2022-04-27 10:53:57,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {1727#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1727#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:57,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1727#(<= main_~i~0 0)} is VALID [2022-04-27 10:53:57,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1685#true} is VALID [2022-04-27 10:53:57,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret6 := main(); {1685#true} is VALID [2022-04-27 10:53:57,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #70#return; {1685#true} is VALID [2022-04-27 10:53:57,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2022-04-27 10:53:57,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#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(9, 2); {1685#true} is VALID [2022-04-27 10:53:57,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2022-04-27 10:53:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:53:57,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862219937] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:57,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:57,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-27 10:53:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067735921] [2022-04-27 10:53:57,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:57,021 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-04-27 10:53:57,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:57,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:53:57,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:57,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:53:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:53:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:53:57,062 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:53:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:57,430 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-27 10:53:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:53:57,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-04-27 10:53:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:53:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-27 10:53:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:53:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-27 10:53:57,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-27 10:53:57,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:57,478 INFO L225 Difference]: With dead ends: 60 [2022-04-27 10:53:57,478 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 10:53:57,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:53:57,479 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:57,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 10:53:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 10:53:57,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:57,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:57,489 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:57,489 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:57,491 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-27 10:53:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-27 10:53:57,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:57,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:57,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-27 10:53:57,492 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-27 10:53:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:57,493 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-27 10:53:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-27 10:53:57,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:57,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:57,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:57,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:53:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-27 10:53:57,495 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-27 10:53:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:57,495 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-27 10:53:57,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:53:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-27 10:53:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 10:53:57,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:57,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:57,522 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:53:57,719 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:53:57,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 5 times [2022-04-27 10:53:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061889764] [2022-04-27 10:53:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:57,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {2173#(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(9, 2); {2149#true} is VALID [2022-04-27 10:53:57,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:53:57,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2149#true} {2149#true} #70#return; {2149#true} is VALID [2022-04-27 10:53:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:53:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:57,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {2149#true} ~cond := #in~cond; {2149#true} is VALID [2022-04-27 10:53:57,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {2149#true} assume !(0 == ~cond); {2149#true} is VALID [2022-04-27 10:53:57,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:53:57,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2149#true} {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:53:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:57,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {2149#true} ~cond := #in~cond; {2149#true} is VALID [2022-04-27 10:53:57,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {2149#true} assume !(0 == ~cond); {2149#true} is VALID [2022-04-27 10:53:57,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:53:57,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2149#true} {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:57,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {2149#true} call ULTIMATE.init(); {2173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:57,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#(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(9, 2); {2149#true} is VALID [2022-04-27 10:53:57,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:53:57,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2149#true} {2149#true} #70#return; {2149#true} is VALID [2022-04-27 10:53:57,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {2149#true} call #t~ret6 := main(); {2149#true} is VALID [2022-04-27 10:53:57,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {2149#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2149#true} is VALID [2022-04-27 10:53:57,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {2149#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2154#(= main_~i~0 0)} is VALID [2022-04-27 10:53:57,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {2154#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2154#(= main_~i~0 0)} is VALID [2022-04-27 10:53:57,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {2154#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:57,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:53:57,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2156#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:53:57,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {2156#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2157#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:53:57,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {2157#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:53:57,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:53:57,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:57,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:57,897 INFO L272 TraceCheckUtils]: 16: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2149#true} is VALID [2022-04-27 10:53:57,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2149#true} ~cond := #in~cond; {2149#true} is VALID [2022-04-27 10:53:57,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {2149#true} assume !(0 == ~cond); {2149#true} is VALID [2022-04-27 10:53:57,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:53:57,898 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2149#true} {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:57,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:53:57,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:57,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:57,899 INFO L272 TraceCheckUtils]: 24: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2149#true} is VALID [2022-04-27 10:53:57,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#true} ~cond := #in~cond; {2149#true} is VALID [2022-04-27 10:53:57,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {2149#true} assume !(0 == ~cond); {2149#true} is VALID [2022-04-27 10:53:57,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:53:57,900 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2149#true} {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:57,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:53:57,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2169#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:53:57,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {2169#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2170#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:53:57,902 INFO L272 TraceCheckUtils]: 32: Hoare triple {2170#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:57,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {2171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:57,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {2172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2150#false} is VALID [2022-04-27 10:53:57,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {2150#false} assume !false; {2150#false} is VALID [2022-04-27 10:53:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:53:57,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:57,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061889764] [2022-04-27 10:53:57,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061889764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831622917] [2022-04-27 10:53:57,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:53:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:57,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:57,908 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:53:57,918 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:53:57,963 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 10:53:57,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:53:57,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:53:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:57,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:58,062 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:54:06,539 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 19 treesize of output 7 [2022-04-27 10:54:06,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {2149#true} call ULTIMATE.init(); {2149#true} is VALID [2022-04-27 10:54:06,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2149#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(9, 2); {2149#true} is VALID [2022-04-27 10:54:06,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:54:06,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2149#true} {2149#true} #70#return; {2149#true} is VALID [2022-04-27 10:54:06,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2149#true} call #t~ret6 := main(); {2149#true} is VALID [2022-04-27 10:54:06,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2149#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2149#true} is VALID [2022-04-27 10:54:06,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {2149#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2154#(= main_~i~0 0)} is VALID [2022-04-27 10:54:06,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {2154#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2154#(= main_~i~0 0)} is VALID [2022-04-27 10:54:06,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {2154#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:06,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:06,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2156#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:06,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {2156#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:06,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:06,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:06,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:06,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:06,597 INFO L272 TraceCheckUtils]: 16: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} ~cond := #in~cond; {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} assume !(0 == ~cond); {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} assume true; {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,599 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:06,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:06,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {2159#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:06,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:06,602 INFO L272 TraceCheckUtils]: 24: Hoare triple {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} ~cond := #in~cond; {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} assume !(0 == ~cond); {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} assume true; {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} is VALID [2022-04-27 10:54:06,604 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2225#(exists ((v_main_~x~0.base_BEFORE_CALL_5 Int) (v_main_~x~0.offset_BEFORE_CALL_5 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_5) (+ 8 v_main_~x~0.offset_BEFORE_CALL_5)) 0))} {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:06,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:06,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {2244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2269#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 2))} is VALID [2022-04-27 10:54:06,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {2269#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2170#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:06,606 INFO L272 TraceCheckUtils]: 32: Hoare triple {2170#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:06,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:06,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {2280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2150#false} is VALID [2022-04-27 10:54:06,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {2150#false} assume !false; {2150#false} is VALID [2022-04-27 10:54:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:06,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:08,771 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:54:08,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:54:08,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {2150#false} assume !false; {2150#false} is VALID [2022-04-27 10:54:08,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {2280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2150#false} is VALID [2022-04-27 10:54:08,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:08,850 INFO L272 TraceCheckUtils]: 32: Hoare triple {2170#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:08,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {2169#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2170#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:08,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2169#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:08,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:08,853 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2149#true} {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:08,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:54:08,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {2149#true} assume !(0 == ~cond); {2149#true} is VALID [2022-04-27 10:54:08,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#true} ~cond := #in~cond; {2149#true} is VALID [2022-04-27 10:54:08,853 INFO L272 TraceCheckUtils]: 24: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2149#true} is VALID [2022-04-27 10:54:08,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:08,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2164#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:08,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:08,856 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2149#true} {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:08,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:54:08,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {2149#true} assume !(0 == ~cond); {2149#true} is VALID [2022-04-27 10:54:08,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {2149#true} ~cond := #in~cond; {2149#true} is VALID [2022-04-27 10:54:08,856 INFO L272 TraceCheckUtils]: 16: Hoare triple {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2149#true} is VALID [2022-04-27 10:54:08,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:08,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {2326#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:08,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:08,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:08,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {2156#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2158#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:08,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2156#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:08,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:08,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {2154#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:08,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2154#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2154#(= main_~i~0 0)} is VALID [2022-04-27 10:54:08,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {2149#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2154#(= main_~i~0 0)} is VALID [2022-04-27 10:54:08,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {2149#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2149#true} is VALID [2022-04-27 10:54:08,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {2149#true} call #t~ret6 := main(); {2149#true} is VALID [2022-04-27 10:54:08,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2149#true} {2149#true} #70#return; {2149#true} is VALID [2022-04-27 10:54:08,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {2149#true} assume true; {2149#true} is VALID [2022-04-27 10:54:08,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {2149#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(9, 2); {2149#true} is VALID [2022-04-27 10:54:08,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {2149#true} call ULTIMATE.init(); {2149#true} is VALID [2022-04-27 10:54:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:08,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831622917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:54:08,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:54:08,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 20 [2022-04-27 10:54:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646981806] [2022-04-27 10:54:08,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:08,863 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2022-04-27 10:54:08,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:08,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:08,908 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:54:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:54:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:54:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=325, Unknown=3, NotChecked=0, Total=380 [2022-04-27 10:54:08,910 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:09,886 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-27 10:54:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:54:09,887 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2022-04-27 10:54:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-27 10:54:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-27 10:54:09,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 53 transitions. [2022-04-27 10:54:09,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:09,952 INFO L225 Difference]: With dead ends: 68 [2022-04-27 10:54:09,952 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 10:54:09,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=135, Invalid=854, Unknown=3, NotChecked=0, Total=992 [2022-04-27 10:54:09,954 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:09,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 98 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 309 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2022-04-27 10:54:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 10:54:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2022-04-27 10:54:09,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:09,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 50 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:09,976 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 50 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:09,976 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 50 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:09,978 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-04-27 10:54:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-04-27 10:54:09,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:09,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:09,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 66 states. [2022-04-27 10:54:09,979 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 66 states. [2022-04-27 10:54:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:09,981 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-04-27 10:54:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2022-04-27 10:54:09,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:09,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:09,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:09,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-04-27 10:54:09,983 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 36 [2022-04-27 10:54:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:09,983 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-04-27 10:54:09,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-27 10:54:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:54:09,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:09,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:10,005 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:54:10,195 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:54:10,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2142797626, now seen corresponding path program 6 times [2022-04-27 10:54:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:10,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654498684] [2022-04-27 10:54:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:54:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:10,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#(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(9, 2); {2720#true} is VALID [2022-04-27 10:54:10,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:10,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2720#true} {2720#true} #70#return; {2720#true} is VALID [2022-04-27 10:54:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 10:54:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:10,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {2720#true} ~cond := #in~cond; {2720#true} is VALID [2022-04-27 10:54:10,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#true} assume !(0 == ~cond); {2720#true} is VALID [2022-04-27 10:54:10,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:10,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:54:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:10,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {2720#true} ~cond := #in~cond; {2720#true} is VALID [2022-04-27 10:54:10,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#true} assume !(0 == ~cond); {2720#true} is VALID [2022-04-27 10:54:10,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:10,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:10,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:54:10,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#(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(9, 2); {2720#true} is VALID [2022-04-27 10:54:10,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:10,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #70#return; {2720#true} is VALID [2022-04-27 10:54:10,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret6 := main(); {2720#true} is VALID [2022-04-27 10:54:10,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2720#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2720#true} is VALID [2022-04-27 10:54:10,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {2720#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2725#(= main_~i~0 0)} is VALID [2022-04-27 10:54:10,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {2725#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2725#(= main_~i~0 0)} is VALID [2022-04-27 10:54:10,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {2725#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:10,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:10,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2727#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:10,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {2727#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2728#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:10,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {2728#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2729#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:10,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {2729#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:10,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:10,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:10,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:10,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:10,393 INFO L272 TraceCheckUtils]: 18: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2720#true} is VALID [2022-04-27 10:54:10,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#true} ~cond := #in~cond; {2720#true} is VALID [2022-04-27 10:54:10,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#true} assume !(0 == ~cond); {2720#true} is VALID [2022-04-27 10:54:10,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:10,394 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2720#true} {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:10,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:10,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:10,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:10,395 INFO L272 TraceCheckUtils]: 26: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2720#true} is VALID [2022-04-27 10:54:10,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {2720#true} ~cond := #in~cond; {2720#true} is VALID [2022-04-27 10:54:10,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {2720#true} assume !(0 == ~cond); {2720#true} is VALID [2022-04-27 10:54:10,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:10,396 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2720#true} {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:10,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:10,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2741#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:10,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {2741#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2742#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:10,398 INFO L272 TraceCheckUtils]: 34: Hoare triple {2742#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:54:10,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {2743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:54:10,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {2744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2721#false} is VALID [2022-04-27 10:54:10,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2022-04-27 10:54:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:10,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654498684] [2022-04-27 10:54:10,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654498684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:54:10,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674466431] [2022-04-27 10:54:10,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:54:10,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:10,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:10,404 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:54:10,420 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:54:10,468 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-27 10:54:10,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:54:10,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 10:54:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:10,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:10,568 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:54:10,832 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-04-27 10:54:10,832 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 27 treesize of output 26 [2022-04-27 10:54:19,286 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 19 treesize of output 7 [2022-04-27 10:54:19,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2022-04-27 10:54:19,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#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(9, 2); {2720#true} is VALID [2022-04-27 10:54:19,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:19,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #70#return; {2720#true} is VALID [2022-04-27 10:54:19,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret6 := main(); {2720#true} is VALID [2022-04-27 10:54:19,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {2720#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2720#true} is VALID [2022-04-27 10:54:19,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {2720#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2725#(= main_~i~0 0)} is VALID [2022-04-27 10:54:19,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {2725#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2725#(= main_~i~0 0)} is VALID [2022-04-27 10:54:19,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {2725#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:19,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:19,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2727#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:19,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {2727#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2728#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:19,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {2728#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2785#(exists ((v_main_~i~0_34 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_34 4))) 0) (<= 2 v_main_~i~0_34) (<= (+ v_main_~i~0_34 1) main_~i~0) (<= v_main_~i~0_34 2)))} is VALID [2022-04-27 10:54:19,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {2785#(exists ((v_main_~i~0_34 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_34 4))) 0) (<= 2 v_main_~i~0_34) (<= (+ v_main_~i~0_34 1) main_~i~0) (<= v_main_~i~0_34 2)))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:19,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:19,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:19,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:19,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:19,347 INFO L272 TraceCheckUtils]: 18: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} ~cond := #in~cond; {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} assume !(0 == ~cond); {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} assume true; {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,349 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:19,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:19,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {2731#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:54:19,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:54:19,352 INFO L272 TraceCheckUtils]: 26: Hoare triple {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} ~cond := #in~cond; {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} assume !(0 == ~cond); {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} assume true; {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} is VALID [2022-04-27 10:54:19,354 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2804#(exists ((v_main_~x~0.base_BEFORE_CALL_9 Int) (v_main_~x~0.offset_BEFORE_CALL_9 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_9) (+ 8 v_main_~x~0.offset_BEFORE_CALL_9)) 0))} {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} #68#return; {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:54:19,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} havoc #t~mem5; {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:54:19,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {2823#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2848#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 2))} is VALID [2022-04-27 10:54:19,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {2848#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2742#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:19,356 INFO L272 TraceCheckUtils]: 34: Hoare triple {2742#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2855#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:19,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {2855#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2859#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:19,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {2859#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2721#false} is VALID [2022-04-27 10:54:19,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2022-04-27 10:54:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:19,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:21,658 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:54:21,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:54:21,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2022-04-27 10:54:21,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {2859#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2721#false} is VALID [2022-04-27 10:54:21,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {2855#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2859#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:21,728 INFO L272 TraceCheckUtils]: 34: Hoare triple {2742#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2855#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:21,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {2741#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2742#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:21,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2741#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:21,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:21,730 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2720#true} {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:21,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:21,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {2720#true} assume !(0 == ~cond); {2720#true} is VALID [2022-04-27 10:54:21,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {2720#true} ~cond := #in~cond; {2720#true} is VALID [2022-04-27 10:54:21,731 INFO L272 TraceCheckUtils]: 26: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2720#true} is VALID [2022-04-27 10:54:21,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:21,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2736#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:21,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:21,734 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2720#true} {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:21,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:21,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#true} assume !(0 == ~cond); {2720#true} is VALID [2022-04-27 10:54:21,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#true} ~cond := #in~cond; {2720#true} is VALID [2022-04-27 10:54:21,740 INFO L272 TraceCheckUtils]: 18: Hoare triple {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2720#true} is VALID [2022-04-27 10:54:21,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:21,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {2905#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:21,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:21,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:21,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2729#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:21,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {2942#(and (not (<= main_~i~0 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2729#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:21,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2727#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2942#(and (not (<= main_~i~0 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:21,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2727#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:21,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:21,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {2725#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2726#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:21,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {2725#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2725#(= main_~i~0 0)} is VALID [2022-04-27 10:54:21,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {2720#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2725#(= main_~i~0 0)} is VALID [2022-04-27 10:54:21,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {2720#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2720#true} is VALID [2022-04-27 10:54:21,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret6 := main(); {2720#true} is VALID [2022-04-27 10:54:21,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #70#return; {2720#true} is VALID [2022-04-27 10:54:21,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2022-04-27 10:54:21,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#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(9, 2); {2720#true} is VALID [2022-04-27 10:54:21,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2022-04-27 10:54:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:21,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674466431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:54:21,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:54:21,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 23 [2022-04-27 10:54:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645762794] [2022-04-27 10:54:21,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-27 10:54:21,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:21,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:21,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:21,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 10:54:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 10:54:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=436, Unknown=3, NotChecked=0, Total=506 [2022-04-27 10:54:21,806 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:25,571 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-27 10:54:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 10:54:25,571 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-27 10:54:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-27 10:54:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-27 10:54:25,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2022-04-27 10:54:25,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:25,630 INFO L225 Difference]: With dead ends: 89 [2022-04-27 10:54:25,630 INFO L226 Difference]: Without dead ends: 87 [2022-04-27 10:54:25,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=174, Invalid=1225, Unknown=7, NotChecked=0, Total=1406 [2022-04-27 10:54:25,632 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:25,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 114 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 302 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2022-04-27 10:54:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-27 10:54:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2022-04-27 10:54:25,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:25,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 63 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:25,646 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 63 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:25,647 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 63 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:25,649 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-27 10:54:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-27 10:54:25,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:25,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:25,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 87 states. [2022-04-27 10:54:25,650 INFO L87 Difference]: Start difference. First operand has 63 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 87 states. [2022-04-27 10:54:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:25,653 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-27 10:54:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-27 10:54:25,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:25,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:25,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:25,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-04-27 10:54:25,656 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 38 [2022-04-27 10:54:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:25,656 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-04-27 10:54:25,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-27 10:54:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 10:54:25,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:25,657 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:25,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 10:54:25,871 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:54:25,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 507421208, now seen corresponding path program 7 times [2022-04-27 10:54:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:25,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057743839] [2022-04-27 10:54:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:54:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {3427#(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(9, 2); {3401#true} is VALID [2022-04-27 10:54:26,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:26,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3401#true} {3401#true} #70#return; {3401#true} is VALID [2022-04-27 10:54:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 10:54:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {3401#true} ~cond := #in~cond; {3401#true} is VALID [2022-04-27 10:54:26,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#true} assume !(0 == ~cond); {3401#true} is VALID [2022-04-27 10:54:26,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:26,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 10:54:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {3401#true} ~cond := #in~cond; {3401#true} is VALID [2022-04-27 10:54:26,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#true} assume !(0 == ~cond); {3401#true} is VALID [2022-04-27 10:54:26,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:26,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:26,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {3401#true} call ULTIMATE.init(); {3427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:54:26,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {3427#(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(9, 2); {3401#true} is VALID [2022-04-27 10:54:26,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:26,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #70#return; {3401#true} is VALID [2022-04-27 10:54:26,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret6 := main(); {3401#true} is VALID [2022-04-27 10:54:26,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {3401#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3401#true} is VALID [2022-04-27 10:54:26,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {3401#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3406#(= main_~i~0 0)} is VALID [2022-04-27 10:54:26,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {3406#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3406#(= main_~i~0 0)} is VALID [2022-04-27 10:54:26,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {3406#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:26,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:26,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3408#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:26,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {3408#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3409#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:26,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {3409#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} is VALID [2022-04-27 10:54:26,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} is VALID [2022-04-27 10:54:26,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3411#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:26,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {3411#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:26,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:26,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:26,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:26,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:26,141 INFO L272 TraceCheckUtils]: 20: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3401#true} is VALID [2022-04-27 10:54:26,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {3401#true} ~cond := #in~cond; {3401#true} is VALID [2022-04-27 10:54:26,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {3401#true} assume !(0 == ~cond); {3401#true} is VALID [2022-04-27 10:54:26,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:26,142 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3401#true} {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:26,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:26,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:26,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:26,144 INFO L272 TraceCheckUtils]: 28: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3401#true} is VALID [2022-04-27 10:54:26,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {3401#true} ~cond := #in~cond; {3401#true} is VALID [2022-04-27 10:54:26,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {3401#true} assume !(0 == ~cond); {3401#true} is VALID [2022-04-27 10:54:26,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:26,145 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3401#true} {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:26,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:26,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:26,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {3423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3424#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:26,147 INFO L272 TraceCheckUtils]: 36: Hoare triple {3424#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3425#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:54:26,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {3425#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3426#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:54:26,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {3426#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3402#false} is VALID [2022-04-27 10:54:26,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2022-04-27 10:54:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:26,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057743839] [2022-04-27 10:54:26,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057743839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:54:26,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038336719] [2022-04-27 10:54:26,148 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 10:54:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:26,152 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:54:26,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 10:54:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 10:54:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:26,272 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:54:26,400 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 10:54:26,401 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 25 treesize of output 24 [2022-04-27 10:54:26,480 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 10:54:26,480 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 25 treesize of output 24 [2022-04-27 10:54:34,838 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 19 treesize of output 7 [2022-04-27 10:54:34,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {3401#true} call ULTIMATE.init(); {3401#true} is VALID [2022-04-27 10:54:34,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#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(9, 2); {3401#true} is VALID [2022-04-27 10:54:34,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:34,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #70#return; {3401#true} is VALID [2022-04-27 10:54:34,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret6 := main(); {3401#true} is VALID [2022-04-27 10:54:34,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {3401#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3401#true} is VALID [2022-04-27 10:54:34,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {3401#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3406#(= main_~i~0 0)} is VALID [2022-04-27 10:54:34,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {3406#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3406#(= main_~i~0 0)} is VALID [2022-04-27 10:54:34,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {3406#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:34,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:34,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3408#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:34,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {3408#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3409#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:34,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {3409#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} is VALID [2022-04-27 10:54:34,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} is VALID [2022-04-27 10:54:34,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3473#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 4 main_~i~0))} is VALID [2022-04-27 10:54:34,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:34,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:34,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:34,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:34,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:34,888 INFO L272 TraceCheckUtils]: 20: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} ~cond := #in~cond; {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} assume !(0 == ~cond); {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} assume true; {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,890 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:34,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:34,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {3413#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:34,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:34,906 INFO L272 TraceCheckUtils]: 28: Hoare triple {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} ~cond := #in~cond; {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} assume !(0 == ~cond); {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} assume true; {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} is VALID [2022-04-27 10:54:34,908 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3492#(exists ((v_main_~x~0.base_BEFORE_CALL_13 Int) (v_main_~x~0.offset_BEFORE_CALL_13 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_13) (+ 8 v_main_~x~0.offset_BEFORE_CALL_13)) 0))} {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:34,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:54:34,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {3511#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3536#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:34,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {3536#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3424#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:34,909 INFO L272 TraceCheckUtils]: 36: Hoare triple {3424#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:34,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {3543#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:34,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {3547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3402#false} is VALID [2022-04-27 10:54:34,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2022-04-27 10:54:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:54:34,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:37,238 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:54:37,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:54:37,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {3402#false} assume !false; {3402#false} is VALID [2022-04-27 10:54:37,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {3547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3402#false} is VALID [2022-04-27 10:54:37,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {3543#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:37,310 INFO L272 TraceCheckUtils]: 36: Hoare triple {3424#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:37,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {3423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3424#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:37,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:37,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:37,312 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3401#true} {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:37,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:37,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {3401#true} assume !(0 == ~cond); {3401#true} is VALID [2022-04-27 10:54:37,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {3401#true} ~cond := #in~cond; {3401#true} is VALID [2022-04-27 10:54:37,312 INFO L272 TraceCheckUtils]: 28: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3401#true} is VALID [2022-04-27 10:54:37,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:37,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3418#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:37,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:37,314 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3401#true} {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:37,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:37,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {3401#true} assume !(0 == ~cond); {3401#true} is VALID [2022-04-27 10:54:37,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {3401#true} ~cond := #in~cond; {3401#true} is VALID [2022-04-27 10:54:37,314 INFO L272 TraceCheckUtils]: 20: Hoare triple {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3401#true} is VALID [2022-04-27 10:54:37,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:37,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {3593#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:37,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:37,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:37,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {3411#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-27 10:54:37,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {3630#(and (not (<= main_~i~0 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3411#(and (not (= (+ main_~x~0.offset 8) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:37,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3630#(and (not (<= main_~i~0 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:37,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {3630#(and (not (<= main_~i~0 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3410#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (<= 3 main_~i~0))} is VALID [2022-04-27 10:54:37,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {3408#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3630#(and (not (<= main_~i~0 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))} is VALID [2022-04-27 10:54:37,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3408#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:37,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:37,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {3406#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3407#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:37,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {3406#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3406#(= main_~i~0 0)} is VALID [2022-04-27 10:54:37,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {3401#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3406#(= main_~i~0 0)} is VALID [2022-04-27 10:54:37,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {3401#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3401#true} is VALID [2022-04-27 10:54:37,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {3401#true} call #t~ret6 := main(); {3401#true} is VALID [2022-04-27 10:54:37,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3401#true} {3401#true} #70#return; {3401#true} is VALID [2022-04-27 10:54:37,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {3401#true} assume true; {3401#true} is VALID [2022-04-27 10:54:37,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {3401#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(9, 2); {3401#true} is VALID [2022-04-27 10:54:37,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {3401#true} call ULTIMATE.init(); {3401#true} is VALID [2022-04-27 10:54:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:54:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038336719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:54:37,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:54:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 24 [2022-04-27 10:54:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268776385] [2022-04-27 10:54:37,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:37,322 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-04-27 10:54:37,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:37,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:37,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 10:54:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 10:54:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=475, Unknown=3, NotChecked=0, Total=552 [2022-04-27 10:54:37,374 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:38,730 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-27 10:54:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 10:54:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-04-27 10:54:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 56 transitions. [2022-04-27 10:54:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 56 transitions. [2022-04-27 10:54:38,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 56 transitions. [2022-04-27 10:54:38,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:38,803 INFO L225 Difference]: With dead ends: 84 [2022-04-27 10:54:38,803 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 10:54:38,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=205, Invalid=1431, Unknown=4, NotChecked=0, Total=1640 [2022-04-27 10:54:38,804 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:38,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 119 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 467 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-04-27 10:54:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 10:54:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-04-27 10:54:38,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:38,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 73 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 10:54:38,827 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 73 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 10:54:38,827 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 73 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 10:54:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:38,830 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-27 10:54:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-27 10:54:38,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:38,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:38,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 82 states. [2022-04-27 10:54:38,831 INFO L87 Difference]: Start difference. First operand has 73 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 82 states. [2022-04-27 10:54:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:38,839 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-27 10:54:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-27 10:54:38,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:38,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:38,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:38,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 10:54:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-04-27 10:54:38,843 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 40 [2022-04-27 10:54:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:38,843 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-04-27 10:54:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:54:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-27 10:54:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 10:54:38,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:38,844 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:38,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 10:54:39,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 10:54:39,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 8 times [2022-04-27 10:54:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:39,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303357798] [2022-04-27 10:54:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:54:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:39,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {4125#(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(9, 2); {4099#true} is VALID [2022-04-27 10:54:39,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4099#true} {4099#true} #70#return; {4099#true} is VALID [2022-04-27 10:54:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:54:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:39,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-27 10:54:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:54:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:39,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4114#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:54:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:39,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4119#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {4099#true} call ULTIMATE.init(); {4125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:54:39,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {4125#(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(9, 2); {4099#true} is VALID [2022-04-27 10:54:39,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4099#true} #70#return; {4099#true} is VALID [2022-04-27 10:54:39,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {4099#true} call #t~ret6 := main(); {4099#true} is VALID [2022-04-27 10:54:39,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {4099#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4099#true} is VALID [2022-04-27 10:54:39,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {4099#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4104#(= main_~i~0 0)} is VALID [2022-04-27 10:54:39,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {4104#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4104#(= main_~i~0 0)} is VALID [2022-04-27 10:54:39,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {4104#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4105#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:39,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {4105#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4105#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:39,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {4105#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4106#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:39,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {4106#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4106#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:39,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {4106#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4107#(<= main_~i~0 3)} is VALID [2022-04-27 10:54:39,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {4107#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {4108#(<= main_~n~0 3)} is VALID [2022-04-27 10:54:39,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {4108#(<= main_~n~0 3)} ~i~1 := 0; {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-27 10:54:39,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-27 10:54:39,180 INFO L272 TraceCheckUtils]: 16: Hoare triple {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,181 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4099#true} {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-27 10:54:39,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} havoc #t~mem5; {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-27 10:54:39,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {4109#(and (<= main_~n~0 3) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,183 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4099#true} {4114#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,184 INFO L272 TraceCheckUtils]: 32: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,185 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4099#true} {4119#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4124#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 10:54:39,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {4124#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4100#false} is VALID [2022-04-27 10:54:39,186 INFO L272 TraceCheckUtils]: 40: Hoare triple {4100#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4100#false} is VALID [2022-04-27 10:54:39,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {4100#false} ~cond := #in~cond; {4100#false} is VALID [2022-04-27 10:54:39,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {4100#false} assume 0 == ~cond; {4100#false} is VALID [2022-04-27 10:54:39,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {4100#false} assume !false; {4100#false} is VALID [2022-04-27 10:54:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:54:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303357798] [2022-04-27 10:54:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303357798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:54:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269709268] [2022-04-27 10:54:39,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:54:39,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:39,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:39,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:54:39,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 10:54:39,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:54:39,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:54:39,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:54:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:39,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:39,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {4099#true} call ULTIMATE.init(); {4099#true} is VALID [2022-04-27 10:54:39,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#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(9, 2); {4099#true} is VALID [2022-04-27 10:54:39,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4099#true} #70#return; {4099#true} is VALID [2022-04-27 10:54:39,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {4099#true} call #t~ret6 := main(); {4099#true} is VALID [2022-04-27 10:54:39,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {4099#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4099#true} is VALID [2022-04-27 10:54:39,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {4099#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4147#(<= main_~i~0 0)} is VALID [2022-04-27 10:54:39,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {4147#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 0)} is VALID [2022-04-27 10:54:39,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {4147#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4105#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:39,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {4105#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4105#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:39,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {4105#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4106#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:39,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {4106#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4106#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:39,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {4106#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4107#(<= main_~i~0 3)} is VALID [2022-04-27 10:54:39,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {4107#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {4108#(<= main_~n~0 3)} is VALID [2022-04-27 10:54:39,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {4108#(<= main_~n~0 3)} ~i~1 := 0; {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,558 INFO L272 TraceCheckUtils]: 16: Hoare triple {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,559 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4099#true} {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #68#return; {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {4172#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,560 INFO L272 TraceCheckUtils]: 24: Hoare triple {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,560 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4099#true} {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #68#return; {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {4197#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,562 INFO L272 TraceCheckUtils]: 32: Hoare triple {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,562 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4099#true} {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #68#return; {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {4222#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4247#(and (<= 3 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-27 10:54:39,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {4247#(and (<= 3 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4100#false} is VALID [2022-04-27 10:54:39,564 INFO L272 TraceCheckUtils]: 40: Hoare triple {4100#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4100#false} is VALID [2022-04-27 10:54:39,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {4100#false} ~cond := #in~cond; {4100#false} is VALID [2022-04-27 10:54:39,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {4100#false} assume 0 == ~cond; {4100#false} is VALID [2022-04-27 10:54:39,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {4100#false} assume !false; {4100#false} is VALID [2022-04-27 10:54:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:54:39,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:39,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {4100#false} assume !false; {4100#false} is VALID [2022-04-27 10:54:39,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {4100#false} assume 0 == ~cond; {4100#false} is VALID [2022-04-27 10:54:39,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {4100#false} ~cond := #in~cond; {4100#false} is VALID [2022-04-27 10:54:39,791 INFO L272 TraceCheckUtils]: 40: Hoare triple {4100#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4100#false} is VALID [2022-04-27 10:54:39,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {4124#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4100#false} is VALID [2022-04-27 10:54:39,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4124#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 10:54:39,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,793 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4099#true} {4119#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,793 INFO L272 TraceCheckUtils]: 32: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {4119#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4119#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 10:54:39,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,795 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4099#true} {4114#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,795 INFO L272 TraceCheckUtils]: 24: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {4114#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {4326#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4114#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 10:54:39,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {4326#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {4326#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 10:54:39,797 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4099#true} {4326#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {4326#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 10:54:39,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {4099#true} assume !(0 == ~cond); {4099#true} is VALID [2022-04-27 10:54:39,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {4099#true} ~cond := #in~cond; {4099#true} is VALID [2022-04-27 10:54:39,797 INFO L272 TraceCheckUtils]: 16: Hoare triple {4326#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4099#true} is VALID [2022-04-27 10:54:39,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {4326#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4326#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 10:54:39,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {4108#(<= main_~n~0 3)} ~i~1 := 0; {4326#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 10:54:39,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {4107#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {4108#(<= main_~n~0 3)} is VALID [2022-04-27 10:54:39,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {4106#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4107#(<= main_~i~0 3)} is VALID [2022-04-27 10:54:39,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {4106#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4106#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:39,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {4105#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4106#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:39,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {4105#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4105#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:39,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {4147#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4105#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:39,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {4147#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 0)} is VALID [2022-04-27 10:54:39,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {4099#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4147#(<= main_~i~0 0)} is VALID [2022-04-27 10:54:39,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {4099#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4099#true} is VALID [2022-04-27 10:54:39,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {4099#true} call #t~ret6 := main(); {4099#true} is VALID [2022-04-27 10:54:39,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4099#true} #70#return; {4099#true} is VALID [2022-04-27 10:54:39,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} assume true; {4099#true} is VALID [2022-04-27 10:54:39,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#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(9, 2); {4099#true} is VALID [2022-04-27 10:54:39,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {4099#true} call ULTIMATE.init(); {4099#true} is VALID [2022-04-27 10:54:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:54:39,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269709268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:54:39,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:54:39,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-27 10:54:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775441336] [2022-04-27 10:54:39,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:39,805 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 44 [2022-04-27 10:54:39,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:39,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:54:39,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:39,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:54:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:54:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:54:39,850 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:54:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:40,361 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-04-27 10:54:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:54:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 44 [2022-04-27 10:54:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:54:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-27 10:54:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:54:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-27 10:54:40,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-27 10:54:40,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:40,414 INFO L225 Difference]: With dead ends: 90 [2022-04-27 10:54:40,414 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 10:54:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:54:40,415 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:40,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:54:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 10:54:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-27 10:54:40,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:40,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 49 states have internal predecessors, (50), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:40,432 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 49 states have internal predecessors, (50), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:40,433 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 49 states have internal predecessors, (50), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:40,434 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-27 10:54:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-27 10:54:40,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:40,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:40,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 49 states have internal predecessors, (50), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 62 states. [2022-04-27 10:54:40,435 INFO L87 Difference]: Start difference. First operand has 62 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 49 states have internal predecessors, (50), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 62 states. [2022-04-27 10:54:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:40,436 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-27 10:54:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-27 10:54:40,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:40,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:40,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:40,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 49 states have internal predecessors, (50), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-27 10:54:40,438 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 44 [2022-04-27 10:54:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:40,439 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-27 10:54:40,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:54:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-27 10:54:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 10:54:40,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:40,439 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:40,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 10:54:40,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 10:54:40,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 9 times [2022-04-27 10:54:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:40,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461121669] [2022-04-27 10:54:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:54:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:40,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {4784#(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(9, 2); {4754#true} is VALID [2022-04-27 10:54:40,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4754#true} {4754#true} #70#return; {4754#true} is VALID [2022-04-27 10:54:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 10:54:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:40,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {4754#true} ~cond := #in~cond; {4754#true} is VALID [2022-04-27 10:54:40,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {4754#true} assume !(0 == ~cond); {4754#true} is VALID [2022-04-27 10:54:40,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#true} {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:54:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:40,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {4754#true} ~cond := #in~cond; {4754#true} is VALID [2022-04-27 10:54:40,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {4754#true} assume !(0 == ~cond); {4754#true} is VALID [2022-04-27 10:54:40,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#true} {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-27 10:54:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:40,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {4754#true} ~cond := #in~cond; {4754#true} is VALID [2022-04-27 10:54:40,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {4754#true} assume !(0 == ~cond); {4754#true} is VALID [2022-04-27 10:54:40,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#true} {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:40,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4754#true} call ULTIMATE.init(); {4784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:54:40,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4784#(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(9, 2); {4754#true} is VALID [2022-04-27 10:54:40,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#true} {4754#true} #70#return; {4754#true} is VALID [2022-04-27 10:54:40,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {4754#true} call #t~ret6 := main(); {4754#true} is VALID [2022-04-27 10:54:40,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {4754#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4754#true} is VALID [2022-04-27 10:54:40,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {4754#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4759#(= main_~i~0 0)} is VALID [2022-04-27 10:54:40,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {4759#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4759#(= main_~i~0 0)} is VALID [2022-04-27 10:54:40,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {4759#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4760#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:40,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {4760#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4760#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:40,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {4760#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4761#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:40,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {4761#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4761#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:40,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {4761#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4762#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:54:40,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4763#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:54:40,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {4763#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4764#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-27 10:54:40,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {4764#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} assume !(~i~0 < ~n~0); {4764#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-27 10:54:40,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {4764#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} ~i~1 := 0; {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:40,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:40,875 INFO L272 TraceCheckUtils]: 18: Hoare triple {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4754#true} is VALID [2022-04-27 10:54:40,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {4754#true} ~cond := #in~cond; {4754#true} is VALID [2022-04-27 10:54:40,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {4754#true} assume !(0 == ~cond); {4754#true} is VALID [2022-04-27 10:54:40,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,876 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4754#true} {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:40,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} havoc #t~mem5; {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:40,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {4765#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:40,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:40,878 INFO L272 TraceCheckUtils]: 26: Hoare triple {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4754#true} is VALID [2022-04-27 10:54:40,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {4754#true} ~cond := #in~cond; {4754#true} is VALID [2022-04-27 10:54:40,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {4754#true} assume !(0 == ~cond); {4754#true} is VALID [2022-04-27 10:54:40,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,878 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4754#true} {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:40,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:40,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {4770#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:40,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:40,880 INFO L272 TraceCheckUtils]: 34: Hoare triple {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4754#true} is VALID [2022-04-27 10:54:40,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {4754#true} ~cond := #in~cond; {4754#true} is VALID [2022-04-27 10:54:40,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {4754#true} assume !(0 == ~cond); {4754#true} is VALID [2022-04-27 10:54:40,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:40,881 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4754#true} {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:40,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:40,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {4775#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4780#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:40,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {4780#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4781#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:40,884 INFO L272 TraceCheckUtils]: 42: Hoare triple {4781#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4782#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:54:40,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {4782#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4783#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:54:40,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {4783#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4755#false} is VALID [2022-04-27 10:54:40,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {4755#false} assume !false; {4755#false} is VALID [2022-04-27 10:54:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:54:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461121669] [2022-04-27 10:54:40,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461121669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:54:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379056453] [2022-04-27 10:54:40,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:54:40,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:40,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:54:40,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 10:54:40,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 10:54:40,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:54:40,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:54:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:40,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:41,069 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:54:43,937 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-27 10:54:43,941 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 23 treesize of output 10 [2022-04-27 10:54:44,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {4754#true} call ULTIMATE.init(); {4754#true} is VALID [2022-04-27 10:54:44,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {4754#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(9, 2); {4754#true} is VALID [2022-04-27 10:54:44,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#true} assume true; {4754#true} is VALID [2022-04-27 10:54:44,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#true} {4754#true} #70#return; {4754#true} is VALID [2022-04-27 10:54:44,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {4754#true} call #t~ret6 := main(); {4754#true} is VALID [2022-04-27 10:54:44,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {4754#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4754#true} is VALID [2022-04-27 10:54:44,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {4754#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4806#(<= main_~i~0 0)} is VALID [2022-04-27 10:54:44,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4806#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4806#(<= main_~i~0 0)} is VALID [2022-04-27 10:54:44,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {4806#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4813#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:44,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {4813#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4813#(<= main_~i~0 1)} is VALID [2022-04-27 10:54:44,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {4813#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4820#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:44,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {4820#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4820#(<= main_~i~0 2)} is VALID [2022-04-27 10:54:44,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {4820#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4827#(<= main_~i~0 3)} is VALID [2022-04-27 10:54:44,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {4827#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4831#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:54:44,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {4831#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4835#(exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~i~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0)))} is VALID [2022-04-27 10:54:44,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {4835#(exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~i~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0)))} assume !(~i~0 < ~n~0); {4839#(exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0)))} is VALID [2022-04-27 10:54:44,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {4839#(exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0)))} ~i~1 := 0; {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,051 INFO L272 TraceCheckUtils]: 18: Hoare triple {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} ~cond := #in~cond; {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} assume !(0 == ~cond); {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} assume true; {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,053 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} #68#return; {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} havoc #t~mem5; {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {4843#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,060 INFO L272 TraceCheckUtils]: 26: Hoare triple {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} ~cond := #in~cond; {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} assume !(0 == ~cond); {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} assume true; {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,062 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} #68#return; {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} havoc #t~mem5; {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} is VALID [2022-04-27 10:54:44,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {4869#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:54:44,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:54:44,081 INFO L272 TraceCheckUtils]: 34: Hoare triple {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} ~cond := #in~cond; {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} assume !(0 == ~cond); {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} assume true; {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} is VALID [2022-04-27 10:54:44,083 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4850#(exists ((v_main_~i~0_60 Int) (v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int)) (and (<= v_main_~i~0_60 3) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ (* v_main_~i~0_60 4) v_main_~x~0.offset_BEFORE_CALL_17)) 0)))} {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} #68#return; {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:54:44,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} havoc #t~mem5; {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:54:44,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {4894#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4919#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 3 main_~i~1))} is VALID [2022-04-27 10:54:44,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {4919#(and (exists ((v_main_~i~0_60 Int)) (and (<= v_main_~i~0_60 3) (<= main_~n~0 (+ v_main_~i~0_60 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_60 4))) 0))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4781#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:44,086 INFO L272 TraceCheckUtils]: 42: Hoare triple {4781#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:54:44,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {4926#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:54:44,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {4930#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4755#false} is VALID [2022-04-27 10:54:44,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {4755#false} assume !false; {4755#false} is VALID [2022-04-27 10:54:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:54:44,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:44,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379056453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:54:44,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:54:44,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-04-27 10:54:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723283344] [2022-04-27 10:54:44,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:44,388 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 46 [2022-04-27 10:54:44,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:44,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:44,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 10:54:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 10:54:44,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:54:44,483 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:45,159 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-27 10:54:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 10:54:45,159 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 46 [2022-04-27 10:54:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2022-04-27 10:54:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2022-04-27 10:54:45,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 61 transitions. [2022-04-27 10:54:49,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 59 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:49,236 INFO L225 Difference]: With dead ends: 87 [2022-04-27 10:54:49,237 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 10:54:49,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=2016, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:54:49,238 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:49,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 249 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 140 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2022-04-27 10:54:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 10:54:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 10:54:49,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:49,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:49,266 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:49,266 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:49,267 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-04-27 10:54:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-27 10:54:49,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:49,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:49,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 10:54:49,268 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 10:54:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:49,269 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-04-27 10:54:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-27 10:54:49,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:49,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:49,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:49,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:54:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-27 10:54:49,270 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-04-27 10:54:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:49,271 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-27 10:54:49,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:54:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-27 10:54:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 10:54:49,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:49,271 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:49,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 10:54:49,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 10:54:49,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1454149646, now seen corresponding path program 10 times [2022-04-27 10:54:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:49,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706961213] [2022-04-27 10:54:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:54:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:49,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {5327#(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(9, 2); {5296#true} is VALID [2022-04-27 10:54:49,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5296#true} {5296#true} #70#return; {5296#true} is VALID [2022-04-27 10:54:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 10:54:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:49,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:54:49,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:54:49,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5296#true} {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 10:54:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:49,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:54:49,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:54:49,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5296#true} {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-27 10:54:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:49,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:54:49,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:54:49,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5296#true} {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:49,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {5296#true} call ULTIMATE.init(); {5327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:54:49,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {5327#(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(9, 2); {5296#true} is VALID [2022-04-27 10:54:49,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5296#true} {5296#true} #70#return; {5296#true} is VALID [2022-04-27 10:54:49,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {5296#true} call #t~ret6 := main(); {5296#true} is VALID [2022-04-27 10:54:49,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {5296#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5296#true} is VALID [2022-04-27 10:54:49,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {5296#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5301#(= main_~i~0 0)} is VALID [2022-04-27 10:54:49,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {5301#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5301#(= main_~i~0 0)} is VALID [2022-04-27 10:54:49,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {5301#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5302#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:49,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {5302#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5302#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:54:49,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {5302#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5303#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:49,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {5303#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5303#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:54:49,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {5303#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5304#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:54:49,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {5304#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5305#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:54:49,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {5305#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5306#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (not (= (+ main_~x~0.offset 12) (+ main_~x~0.offset (* main_~i~0 4)))))} is VALID [2022-04-27 10:54:49,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {5306#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (not (= (+ main_~x~0.offset 12) (+ main_~x~0.offset (* main_~i~0 4)))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-27 10:54:49,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {5307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-27 10:54:49,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {5307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} assume !(~i~0 < ~n~0); {5307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-27 10:54:49,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {5307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} ~i~1 := 0; {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:49,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:49,753 INFO L272 TraceCheckUtils]: 20: Hoare triple {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5296#true} is VALID [2022-04-27 10:54:49,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:54:49,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:54:49,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,754 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5296#true} {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:49,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} havoc #t~mem5; {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:54:49,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:49,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:49,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5296#true} is VALID [2022-04-27 10:54:49,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:54:49,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:54:49,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,757 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5296#true} {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:49,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:54:49,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {5313#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:49,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:49,758 INFO L272 TraceCheckUtils]: 36: Hoare triple {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5296#true} is VALID [2022-04-27 10:54:49,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:54:49,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:54:49,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:54:49,759 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5296#true} {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:49,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:54:49,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {5318#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5323#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:54:49,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {5323#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5324#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:54:49,761 INFO L272 TraceCheckUtils]: 44: Hoare triple {5324#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5325#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:54:49,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {5325#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5326#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:54:49,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {5326#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5297#false} is VALID [2022-04-27 10:54:49,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {5297#false} assume !false; {5297#false} is VALID [2022-04-27 10:54:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:54:49,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:49,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706961213] [2022-04-27 10:54:49,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706961213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:54:49,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997411091] [2022-04-27 10:54:49,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:54:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:49,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:49,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:54:49,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 10:54:49,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:54:49,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:54:49,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 10:54:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:49,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:49,983 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:54:50,061 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-04-27 10:54:50,061 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 28 treesize of output 27 [2022-04-27 10:55:09,493 INFO L356 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-04-27 10:55:09,494 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 36 treesize of output 13 [2022-04-27 10:55:09,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {5296#true} call ULTIMATE.init(); {5296#true} is VALID [2022-04-27 10:55:09,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#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(9, 2); {5296#true} is VALID [2022-04-27 10:55:09,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:55:09,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5296#true} {5296#true} #70#return; {5296#true} is VALID [2022-04-27 10:55:09,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {5296#true} call #t~ret6 := main(); {5296#true} is VALID [2022-04-27 10:55:09,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {5296#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5296#true} is VALID [2022-04-27 10:55:09,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {5296#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5349#(<= main_~i~0 0)} is VALID [2022-04-27 10:55:09,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {5349#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5349#(<= main_~i~0 0)} is VALID [2022-04-27 10:55:09,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {5349#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5356#(<= main_~i~0 1)} is VALID [2022-04-27 10:55:09,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {5356#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5356#(<= main_~i~0 1)} is VALID [2022-04-27 10:55:09,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {5356#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5363#(<= main_~i~0 2)} is VALID [2022-04-27 10:55:09,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {5363#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5363#(<= main_~i~0 2)} is VALID [2022-04-27 10:55:09,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {5363#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#(<= main_~i~0 3)} is VALID [2022-04-27 10:55:09,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {5370#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5374#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:55:09,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {5374#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5378#(and (<= main_~i~0 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))} is VALID [2022-04-27 10:55:09,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {5378#(and (<= main_~i~0 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))} is VALID [2022-04-27 10:55:09,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {5382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5386#(and (<= main_~i~0 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))} is VALID [2022-04-27 10:55:09,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#(and (<= main_~i~0 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))} assume !(~i~0 < ~n~0); {5390#(exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:09,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {5390#(exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0)))} ~i~1 := 0; {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} is VALID [2022-04-27 10:55:09,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} is VALID [2022-04-27 10:55:09,607 INFO L272 TraceCheckUtils]: 20: Hoare triple {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:09,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} ~cond := #in~cond; {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:09,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} assume !(0 == ~cond); {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:09,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} assume true; {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:09,610 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5401#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_20 Int) (v_main_~x~0.offset_BEFORE_CALL_20 Int)) (and (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ v_main_~x~0.offset_BEFORE_CALL_20 (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_20) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_20 (* main_~i~0 4))) 0)))} {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} #68#return; {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} is VALID [2022-04-27 10:55:09,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} havoc #t~mem5; {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} is VALID [2022-04-27 10:55:09,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {5394#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} is VALID [2022-04-27 10:55:09,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} is VALID [2022-04-27 10:55:09,613 INFO L272 TraceCheckUtils]: 28: Hoare triple {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:09,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} ~cond := #in~cond; {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:11,616 WARN L290 TraceCheckUtils]: 30: Hoare triple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} assume !(0 == ~cond); {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is UNKNOWN [2022-04-27 10:55:11,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} assume true; {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:11,618 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} #68#return; {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} is VALID [2022-04-27 10:55:11,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} havoc #t~mem5; {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} is VALID [2022-04-27 10:55:11,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {5420#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:55:11,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:55:11,622 INFO L272 TraceCheckUtils]: 36: Hoare triple {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:11,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} ~cond := #in~cond; {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:11,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} assume !(0 == ~cond); {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:11,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} assume true; {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} is VALID [2022-04-27 10:55:11,624 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5427#(exists ((main_~i~0 Int) (v_main_~x~0.base_BEFORE_CALL_21 Int) (v_main_~x~0.offset_BEFORE_CALL_21 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ (- 4) v_main_~x~0.offset_BEFORE_CALL_21 (* main_~i~0 4))) 0) (<= main_~i~0 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_21) (+ v_main_~x~0.offset_BEFORE_CALL_21 (- 8) (* main_~i~0 4))) 0)))} {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} #68#return; {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:55:11,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} havoc #t~mem5; {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} is VALID [2022-04-27 10:55:11,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {5446#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5471#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 3 main_~i~1))} is VALID [2022-04-27 10:55:11,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {5471#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 5) (not (< main_~i~0 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 8) (* main_~i~0 4))) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (- 4) (* main_~i~0 4))) 0))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5324#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:55:11,627 INFO L272 TraceCheckUtils]: 44: Hoare triple {5324#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:55:11,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {5478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:55:11,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {5482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5297#false} is VALID [2022-04-27 10:55:11,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {5297#false} assume !false; {5297#false} is VALID [2022-04-27 10:55:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 15 proven. 34 refuted. 8 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:55:11,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:55:15,801 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 27 treesize of output 25 [2022-04-27 10:55:15,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2022-04-27 10:55:15,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {5297#false} assume !false; {5297#false} is VALID [2022-04-27 10:55:15,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {5482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5297#false} is VALID [2022-04-27 10:55:15,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {5478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:55:15,952 INFO L272 TraceCheckUtils]: 44: Hoare triple {5324#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:55:15,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {5501#(or (not (< main_~i~1 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5324#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:55:15,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5501#(or (not (< main_~i~1 main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0))} is VALID [2022-04-27 10:55:15,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} havoc #t~mem5; {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} is VALID [2022-04-27 10:55:15,955 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5296#true} {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} #68#return; {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} is VALID [2022-04-27 10:55:15,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:55:15,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:55:15,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:55:15,955 INFO L272 TraceCheckUtils]: 36: Hoare triple {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5296#true} is VALID [2022-04-27 10:55:15,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} is VALID [2022-04-27 10:55:15,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5505#(or (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0) (not (< (+ main_~i~1 1) main_~n~0)))} is VALID [2022-04-27 10:55:15,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} havoc #t~mem5; {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} is VALID [2022-04-27 10:55:15,958 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5296#true} {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} #68#return; {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} is VALID [2022-04-27 10:55:15,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:55:15,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:55:15,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:55:15,958 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5296#true} is VALID [2022-04-27 10:55:15,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} is VALID [2022-04-27 10:55:15,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5530#(or (not (< (+ main_~i~1 2) main_~n~0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8))))} is VALID [2022-04-27 10:55:15,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} havoc #t~mem5; {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} is VALID [2022-04-27 10:55:15,961 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5296#true} {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} #68#return; {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} is VALID [2022-04-27 10:55:15,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:55:15,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {5296#true} assume !(0 == ~cond); {5296#true} is VALID [2022-04-27 10:55:15,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {5296#true} ~cond := #in~cond; {5296#true} is VALID [2022-04-27 10:55:15,961 INFO L272 TraceCheckUtils]: 20: Hoare triple {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5296#true} is VALID [2022-04-27 10:55:15,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} is VALID [2022-04-27 10:55:15,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {5580#(forall ((v_main_~i~1_53 Int)) (or (not (< (+ v_main_~i~1_53 3) main_~n~0)) (not (<= 0 v_main_~i~1_53)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0)))} ~i~1 := 0; {5555#(or (not (< (+ main_~i~1 3) main_~n~0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0))} is VALID [2022-04-27 10:55:15,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(forall ((v_main_~i~1_53 Int)) (or (<= main_~i~0 (+ v_main_~i~1_53 3)) (not (<= 0 v_main_~i~1_53)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0)))} assume !(~i~0 < ~n~0); {5580#(forall ((v_main_~i~1_53 Int)) (or (not (< (+ v_main_~i~1_53 3) main_~n~0)) (not (<= 0 v_main_~i~1_53)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0)))} is VALID [2022-04-27 10:55:15,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {5588#(forall ((v_main_~i~1_53 Int)) (or (<= main_~i~0 (+ v_main_~i~1_53 2)) (not (<= 0 v_main_~i~1_53)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5584#(forall ((v_main_~i~1_53 Int)) (or (<= main_~i~0 (+ v_main_~i~1_53 3)) (not (<= 0 v_main_~i~1_53)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0)))} is VALID [2022-04-27 10:55:15,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {5592#(forall ((v_main_~i~1_53 Int)) (or (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0) (<= main_~i~0 (+ v_main_~i~1_53 2)) (not (<= 0 v_main_~i~1_53))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5588#(forall ((v_main_~i~1_53 Int)) (or (<= main_~i~0 (+ v_main_~i~1_53 2)) (not (<= 0 v_main_~i~1_53)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0)))} is VALID [2022-04-27 10:55:15,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {5596#(forall ((v_main_~i~1_53 Int)) (or (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4 (* main_~i~0 4)) 0) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0) (<= main_~i~0 (+ v_main_~i~1_53 1)) (not (<= 0 v_main_~i~1_53))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5592#(forall ((v_main_~i~1_53 Int)) (or (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0) (<= main_~i~0 (+ v_main_~i~1_53 2)) (not (<= 0 v_main_~i~1_53))))} is VALID [2022-04-27 10:55:15,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {5370#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5596#(forall ((v_main_~i~1_53 Int)) (or (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4 (* main_~i~0 4)) 0) (+ main_~x~0.offset (* v_main_~i~1_53 4) 12)) 0) (<= main_~i~0 (+ v_main_~i~1_53 1)) (not (<= 0 v_main_~i~1_53))))} is VALID [2022-04-27 10:55:15,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {5363#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#(<= main_~i~0 3)} is VALID [2022-04-27 10:55:15,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {5363#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5363#(<= main_~i~0 2)} is VALID [2022-04-27 10:55:15,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {5356#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5363#(<= main_~i~0 2)} is VALID [2022-04-27 10:55:15,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {5356#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5356#(<= main_~i~0 1)} is VALID [2022-04-27 10:55:15,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {5349#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5356#(<= main_~i~0 1)} is VALID [2022-04-27 10:55:15,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {5349#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5349#(<= main_~i~0 0)} is VALID [2022-04-27 10:55:15,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {5296#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5349#(<= main_~i~0 0)} is VALID [2022-04-27 10:55:15,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {5296#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5296#true} is VALID [2022-04-27 10:55:15,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {5296#true} call #t~ret6 := main(); {5296#true} is VALID [2022-04-27 10:55:15,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5296#true} {5296#true} #70#return; {5296#true} is VALID [2022-04-27 10:55:15,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} assume true; {5296#true} is VALID [2022-04-27 10:55:15,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#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(9, 2); {5296#true} is VALID [2022-04-27 10:55:15,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {5296#true} call ULTIMATE.init(); {5296#true} is VALID [2022-04-27 10:55:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 39 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:55:15,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997411091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:55:15,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:55:15,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 43 [2022-04-27 10:55:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456122668] [2022-04-27 10:55:15,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:55:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 48 [2022-04-27 10:55:15,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:55:15,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:55:26,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 99 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-27 10:55:26,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 10:55:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:55:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 10:55:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1597, Unknown=12, NotChecked=0, Total=1806 [2022-04-27 10:55:26,119 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:56:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:56:49,117 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-04-27 10:56:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-27 10:56:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 48 [2022-04-27 10:56:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:56:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:56:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 118 transitions. [2022-04-27 10:56:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:56:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 118 transitions. [2022-04-27 10:56:49,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 118 transitions. [2022-04-27 10:56:59,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 113 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-27 10:56:59,590 INFO L225 Difference]: With dead ends: 120 [2022-04-27 10:56:59,590 INFO L226 Difference]: Without dead ends: 84 [2022-04-27 10:56:59,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 101.9s TimeCoverageRelationStatistics Valid=618, Invalid=6633, Unknown=59, NotChecked=0, Total=7310 [2022-04-27 10:56:59,593 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 443 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:56:59,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 565 Invalid, 0 Unknown, 443 Unchecked, 0.6s Time] [2022-04-27 10:56:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-27 10:56:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 59. [2022-04-27 10:56:59,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:56:59,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 59 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 7 states have call successors, (7), 7 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:56:59,619 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 59 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 7 states have call successors, (7), 7 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:56:59,620 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 59 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 7 states have call successors, (7), 7 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:56:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:56:59,622 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-27 10:56:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-27 10:56:59,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:56:59,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:56:59,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 7 states have call successors, (7), 7 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 84 states. [2022-04-27 10:56:59,623 INFO L87 Difference]: Start difference. First operand has 59 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 7 states have call successors, (7), 7 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 84 states. [2022-04-27 10:56:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:56:59,625 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-27 10:56:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-27 10:56:59,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:56:59,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:56:59,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:56:59,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:56:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 7 states have call successors, (7), 7 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:56:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-27 10:56:59,627 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 48 [2022-04-27 10:56:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:56:59,627 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-27 10:56:59,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 40 states have internal predecessors, (80), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:56:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 10:56:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 10:56:59,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:56:59,628 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:56:59,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 10:56:59,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 10:56:59,835 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:56:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:56:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash 861154090, now seen corresponding path program 11 times [2022-04-27 10:56:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:56:59,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107033490] [2022-04-27 10:56:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:56:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:56:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:57:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {6192#(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(9, 2); {6155#true} is VALID [2022-04-27 10:57:00,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6155#true} {6155#true} #70#return; {6155#true} is VALID [2022-04-27 10:57:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 10:57:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:57:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:57:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 10:57:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:00,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {6155#true} call ULTIMATE.init(); {6192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:57:00,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {6192#(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(9, 2); {6155#true} is VALID [2022-04-27 10:57:00,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6155#true} #70#return; {6155#true} is VALID [2022-04-27 10:57:00,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {6155#true} call #t~ret6 := main(); {6155#true} is VALID [2022-04-27 10:57:00,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {6155#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6155#true} is VALID [2022-04-27 10:57:00,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {6155#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6160#(= main_~i~0 0)} is VALID [2022-04-27 10:57:00,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {6160#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6160#(= main_~i~0 0)} is VALID [2022-04-27 10:57:00,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {6160#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:00,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:00,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:00,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:00,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:00,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:00,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6164#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:00,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {6164#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6165#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:00,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {6165#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6166#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:00,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {6166#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:00,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:00,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:00,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:00,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:00,190 INFO L272 TraceCheckUtils]: 22: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:00,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,191 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6155#true} {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:00,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:00,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:00,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:00,192 INFO L272 TraceCheckUtils]: 30: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:00,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,193 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6155#true} {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:00,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:00,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:00,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:00,195 INFO L272 TraceCheckUtils]: 38: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:00,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,196 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6155#true} {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:00,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:00,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:00,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:00,198 INFO L272 TraceCheckUtils]: 46: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:00,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:00,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:00,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:00,199 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6155#true} {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:00,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:00,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6188#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:00,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {6188#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6189#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:57:00,201 INFO L272 TraceCheckUtils]: 54: Hoare triple {6189#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:57:00,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {6190#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6191#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:57:00,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {6191#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6156#false} is VALID [2022-04-27 10:57:00,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {6156#false} assume !false; {6156#false} is VALID [2022-04-27 10:57:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 10:57:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:57:00,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107033490] [2022-04-27 10:57:00,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107033490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:57:00,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864491582] [2022-04-27 10:57:00,202 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:57:00,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:57:00,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:57:00,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:57:00,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 10:57:00,266 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-04-27 10:57:00,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:57:00,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 10:57:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:00,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:57:00,365 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:57:00,590 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-04-27 10:57:00,590 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 27 treesize of output 26 [2022-04-27 10:57:33,433 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 19 treesize of output 7 [2022-04-27 10:57:33,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {6155#true} call ULTIMATE.init(); {6155#true} is VALID [2022-04-27 10:57:33,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#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(9, 2); {6155#true} is VALID [2022-04-27 10:57:33,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:33,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6155#true} #70#return; {6155#true} is VALID [2022-04-27 10:57:33,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {6155#true} call #t~ret6 := main(); {6155#true} is VALID [2022-04-27 10:57:33,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {6155#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6155#true} is VALID [2022-04-27 10:57:33,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {6155#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6160#(= main_~i~0 0)} is VALID [2022-04-27 10:57:33,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {6160#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6160#(= main_~i~0 0)} is VALID [2022-04-27 10:57:33,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {6160#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:33,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:33,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:33,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:33,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:33,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:33,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6164#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:33,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {6164#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6165#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:33,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {6165#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6244#(exists ((v_main_~i~0_76 Int)) (and (<= 4 v_main_~i~0_76) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_76 4))) 0) (<= v_main_~i~0_76 4) (<= (+ v_main_~i~0_76 1) main_~i~0)))} is VALID [2022-04-27 10:57:33,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {6244#(exists ((v_main_~i~0_76 Int)) (and (<= 4 v_main_~i~0_76) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_76 4))) 0) (<= v_main_~i~0_76 4) (<= (+ v_main_~i~0_76 1) main_~i~0)))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:33,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:33,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:33,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:33,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:33,494 INFO L272 TraceCheckUtils]: 22: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} ~cond := #in~cond; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume !(0 == ~cond); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume true; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,496 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:33,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:33,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {6168#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,498 INFO L272 TraceCheckUtils]: 30: Hoare triple {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} ~cond := #in~cond; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume !(0 == ~cond); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume true; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,500 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #68#return; {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} havoc #t~mem5; {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {6282#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,502 INFO L272 TraceCheckUtils]: 38: Hoare triple {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} ~cond := #in~cond; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume !(0 == ~cond); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume true; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,504 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #68#return; {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} havoc #t~mem5; {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {6307#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,507 INFO L272 TraceCheckUtils]: 46: Hoare triple {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} ~cond := #in~cond; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,508 INFO L290 TraceCheckUtils]: 48: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume !(0 == ~cond); {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} assume true; {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} is VALID [2022-04-27 10:57:33,509 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6263#(exists ((v_main_~x~0.base_BEFORE_CALL_26 Int) (v_main_~x~0.offset_BEFORE_CALL_26 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_26) (+ 16 v_main_~x~0.offset_BEFORE_CALL_26)) 0))} {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #68#return; {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} havoc #t~mem5; {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {6332#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6357#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:33,511 INFO L290 TraceCheckUtils]: 53: Hoare triple {6357#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6189#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:57:33,511 INFO L272 TraceCheckUtils]: 54: Hoare triple {6189#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:57:33,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {6364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:57:33,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {6368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6156#false} is VALID [2022-04-27 10:57:33,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {6156#false} assume !false; {6156#false} is VALID [2022-04-27 10:57:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 10:57:33,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:57:35,830 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:57:35,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:57:35,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {6156#false} assume !false; {6156#false} is VALID [2022-04-27 10:57:35,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {6368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6156#false} is VALID [2022-04-27 10:57:35,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {6364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:57:35,948 INFO L272 TraceCheckUtils]: 54: Hoare triple {6189#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:57:35,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {6188#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6189#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:57:35,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6188#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:35,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:35,950 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6155#true} {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:35,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:35,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:35,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:35,950 INFO L272 TraceCheckUtils]: 46: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:35,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:35,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6183#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:35,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:35,956 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6155#true} {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:35,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:35,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:35,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:35,957 INFO L272 TraceCheckUtils]: 38: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:35,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:35,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6178#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:35,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:35,958 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6155#true} {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:35,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:35,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:35,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:35,959 INFO L272 TraceCheckUtils]: 30: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:35,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:35,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6173#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:35,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:35,961 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6155#true} {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:35,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:35,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {6155#true} assume !(0 == ~cond); {6155#true} is VALID [2022-04-27 10:57:35,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {6155#true} ~cond := #in~cond; {6155#true} is VALID [2022-04-27 10:57:35,961 INFO L272 TraceCheckUtils]: 22: Hoare triple {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6155#true} is VALID [2022-04-27 10:57:35,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:35,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {6462#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:35,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:35,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:35,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {6166#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6167#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:35,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {6499#(and (not (<= main_~i~0 3)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6166#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:35,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {6164#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6499#(and (not (<= main_~i~0 3)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:35,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6164#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:35,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:35,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6163#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:35,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:35,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6162#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:35,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:35,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {6160#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6161#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:35,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {6160#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6160#(= main_~i~0 0)} is VALID [2022-04-27 10:57:35,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {6155#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6160#(= main_~i~0 0)} is VALID [2022-04-27 10:57:35,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {6155#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6155#true} is VALID [2022-04-27 10:57:35,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {6155#true} call #t~ret6 := main(); {6155#true} is VALID [2022-04-27 10:57:35,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6155#true} {6155#true} #70#return; {6155#true} is VALID [2022-04-27 10:57:35,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume true; {6155#true} is VALID [2022-04-27 10:57:35,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#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(9, 2); {6155#true} is VALID [2022-04-27 10:57:35,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {6155#true} call ULTIMATE.init(); {6155#true} is VALID [2022-04-27 10:57:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 10:57:35,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864491582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:57:35,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:57:35,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 29 [2022-04-27 10:57:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296883664] [2022-04-27 10:57:35,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:57:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 58 [2022-04-27 10:57:35,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:57:35,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:57:36,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:57:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 10:57:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:57:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 10:57:36,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=722, Unknown=5, NotChecked=0, Total=812 [2022-04-27 10:57:36,045 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:57:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:57:37,576 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-27 10:57:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:57:37,576 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 58 [2022-04-27 10:57:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:57:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:57:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-27 10:57:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:57:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-27 10:57:37,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 75 transitions. [2022-04-27 10:57:37,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:57:37,662 INFO L225 Difference]: With dead ends: 109 [2022-04-27 10:57:37,662 INFO L226 Difference]: Without dead ends: 107 [2022-04-27 10:57:37,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 103 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=205, Invalid=1860, Unknown=5, NotChecked=0, Total=2070 [2022-04-27 10:57:37,663 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:57:37,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 184 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 729 Invalid, 0 Unknown, 79 Unchecked, 0.6s Time] [2022-04-27 10:57:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-27 10:57:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-04-27 10:57:37,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:57:37,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 100 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:57:37,704 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 100 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:57:37,704 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 100 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:57:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:57:37,706 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-04-27 10:57:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-27 10:57:37,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:57:37,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:57:37,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 107 states. [2022-04-27 10:57:37,707 INFO L87 Difference]: Start difference. First operand has 100 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 107 states. [2022-04-27 10:57:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:57:37,709 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-04-27 10:57:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-27 10:57:37,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:57:37,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:57:37,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:57:37,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:57:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 10:57:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-04-27 10:57:37,712 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 58 [2022-04-27 10:57:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:57:37,712 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-04-27 10:57:37,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 26 states have internal predecessors, (62), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:57:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-04-27 10:57:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 10:57:37,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:57:37,713 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:57:37,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 10:57:37,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 10:57:37,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:57:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:57:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1877331192, now seen corresponding path program 12 times [2022-04-27 10:57:37,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:57:37,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436269559] [2022-04-27 10:57:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:57:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:57:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:57:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {7131#(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(9, 2); {7093#true} is VALID [2022-04-27 10:57:38,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7093#true} {7093#true} #70#return; {7093#true} is VALID [2022-04-27 10:57:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:57:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:57:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-27 10:57:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:57:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:38,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {7093#true} call ULTIMATE.init(); {7131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:57:38,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {7131#(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(9, 2); {7093#true} is VALID [2022-04-27 10:57:38,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7093#true} #70#return; {7093#true} is VALID [2022-04-27 10:57:38,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {7093#true} call #t~ret6 := main(); {7093#true} is VALID [2022-04-27 10:57:38,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {7093#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7093#true} is VALID [2022-04-27 10:57:38,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {7093#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7098#(= main_~i~0 0)} is VALID [2022-04-27 10:57:38,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {7098#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7098#(= main_~i~0 0)} is VALID [2022-04-27 10:57:38,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {7098#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:38,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:57:38,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:38,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:57:38,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:38,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:57:38,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7102#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:38,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7103#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:57:38,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {7103#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7104#(and (<= 5 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:38,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {7104#(and (<= 5 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7104#(and (<= 5 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:38,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {7104#(and (<= 5 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7105#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:57:38,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {7105#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:38,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:38,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:57:38,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:38,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:38,257 INFO L272 TraceCheckUtils]: 24: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:57:38,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,258 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7093#true} {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:38,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:57:38,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:38,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:38,260 INFO L272 TraceCheckUtils]: 32: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:57:38,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,261 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7093#true} {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:38,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:57:38,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:38,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:38,263 INFO L272 TraceCheckUtils]: 40: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:57:38,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,264 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7093#true} {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:38,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:57:38,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:38,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:38,265 INFO L272 TraceCheckUtils]: 48: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:57:38,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:57:38,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:57:38,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:57:38,266 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7093#true} {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:38,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:57:38,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7127#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:57:38,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7128#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:57:38,268 INFO L272 TraceCheckUtils]: 56: Hoare triple {7128#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7129#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:57:38,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {7129#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7130#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:57:38,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {7130#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7094#false} is VALID [2022-04-27 10:57:38,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {7094#false} assume !false; {7094#false} is VALID [2022-04-27 10:57:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 81 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 10:57:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:57:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436269559] [2022-04-27 10:57:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436269559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:57:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515647182] [2022-04-27 10:57:38,270 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:57:38,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:57:38,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:57:38,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:57:38,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 10:57:38,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-27 10:57:38,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:57:38,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 10:57:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:57:38,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:57:38,460 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:57:38,592 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 10:57:38,592 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 25 treesize of output 24 [2022-04-27 10:57:38,626 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 10:57:38,626 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 25 treesize of output 24 [2022-04-27 10:58:11,720 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 19 treesize of output 7 [2022-04-27 10:58:11,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {7093#true} call ULTIMATE.init(); {7093#true} is VALID [2022-04-27 10:58:11,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#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(9, 2); {7093#true} is VALID [2022-04-27 10:58:11,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:58:11,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7093#true} #70#return; {7093#true} is VALID [2022-04-27 10:58:11,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {7093#true} call #t~ret6 := main(); {7093#true} is VALID [2022-04-27 10:58:11,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {7093#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7093#true} is VALID [2022-04-27 10:58:11,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {7093#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7098#(= main_~i~0 0)} is VALID [2022-04-27 10:58:11,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {7098#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7098#(= main_~i~0 0)} is VALID [2022-04-27 10:58:11,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {7098#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:58:11,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:58:11,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:58:11,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:58:11,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:58:11,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:58:11,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7102#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:58:11,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7103#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:58:11,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {7103#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7104#(and (<= 5 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {7104#(and (<= 5 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:11,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:11,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:11,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:11,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:11,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:11,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:11,779 INFO L272 TraceCheckUtils]: 24: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} ~cond := #in~cond; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume !(0 == ~cond); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume true; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,781 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:11,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:11,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {7107#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,783 INFO L272 TraceCheckUtils]: 32: Hoare triple {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} ~cond := #in~cond; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume !(0 == ~cond); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume true; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,785 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #68#return; {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} havoc #t~mem5; {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {7226#(and (= 0 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,787 INFO L272 TraceCheckUtils]: 40: Hoare triple {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} ~cond := #in~cond; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume !(0 == ~cond); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume true; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,788 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #68#return; {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} havoc #t~mem5; {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {7251#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} is VALID [2022-04-27 10:58:11,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} is VALID [2022-04-27 10:58:11,790 INFO L272 TraceCheckUtils]: 48: Hoare triple {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} ~cond := #in~cond; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume !(0 == ~cond); {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} assume true; {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} is VALID [2022-04-27 10:58:11,792 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7207#(exists ((v_main_~x~0.base_BEFORE_CALL_34 Int) (v_main_~x~0.offset_BEFORE_CALL_34 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_34) (+ 16 v_main_~x~0.offset_BEFORE_CALL_34)) 0))} {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} #68#return; {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} is VALID [2022-04-27 10:58:11,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} havoc #t~mem5; {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} is VALID [2022-04-27 10:58:11,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {7276#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= (+ main_~i~1 (- 3)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7301#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:11,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {7301#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7128#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:58:11,794 INFO L272 TraceCheckUtils]: 56: Hoare triple {7128#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:58:11,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {7308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:58:11,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {7312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7094#false} is VALID [2022-04-27 10:58:11,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {7094#false} assume !false; {7094#false} is VALID [2022-04-27 10:58:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 10:58:11,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:58:14,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ 16 c_main_~x~0.offset)) 0)) is different from false [2022-04-27 10:58:14,602 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:58:14,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:58:14,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {7094#false} assume !false; {7094#false} is VALID [2022-04-27 10:58:14,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {7312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7094#false} is VALID [2022-04-27 10:58:14,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {7308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:58:14,694 INFO L272 TraceCheckUtils]: 56: Hoare triple {7128#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:58:14,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7128#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:58:14,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7127#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:14,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:14,696 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7093#true} {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:14,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:58:14,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:58:14,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:58:14,697 INFO L272 TraceCheckUtils]: 48: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:58:14,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:14,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7122#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:14,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:14,699 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7093#true} {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:14,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:58:14,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:58:14,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:58:14,699 INFO L272 TraceCheckUtils]: 40: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:58:14,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:14,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7117#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:14,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:14,701 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7093#true} {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:14,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:58:14,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:58:14,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:58:14,701 INFO L272 TraceCheckUtils]: 32: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:58:14,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:14,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7112#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:14,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:14,703 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7093#true} {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:14,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:58:14,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {7093#true} assume !(0 == ~cond); {7093#true} is VALID [2022-04-27 10:58:14,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {7093#true} ~cond := #in~cond; {7093#true} is VALID [2022-04-27 10:58:14,703 INFO L272 TraceCheckUtils]: 24: Hoare triple {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7093#true} is VALID [2022-04-27 10:58:14,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:14,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {7406#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:14,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:14,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:14,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {7440#(forall ((main_~i~0 Int)) (= 0 (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 16))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7106#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-27 10:58:14,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {7440#(forall ((main_~i~0 Int)) (= 0 (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 16))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7440#(forall ((main_~i~0 Int)) (= 0 (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 16))))} is VALID [2022-04-27 10:58:14,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {7105#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7440#(forall ((main_~i~0 Int)) (= 0 (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 16))))} is VALID [2022-04-27 10:58:14,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {7450#(and (not (<= main_~i~0 3)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7105#(and (not (= (+ main_~x~0.offset 16) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:14,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7450#(and (not (<= main_~i~0 3)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0))} is VALID [2022-04-27 10:58:14,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7102#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:58:14,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:58:14,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7101#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:58:14,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:58:14,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7100#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:58:14,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:58:14,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {7098#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7099#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:58:14,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {7098#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7098#(= main_~i~0 0)} is VALID [2022-04-27 10:58:14,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {7093#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7098#(= main_~i~0 0)} is VALID [2022-04-27 10:58:14,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {7093#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7093#true} is VALID [2022-04-27 10:58:14,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {7093#true} call #t~ret6 := main(); {7093#true} is VALID [2022-04-27 10:58:14,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7093#true} {7093#true} #70#return; {7093#true} is VALID [2022-04-27 10:58:14,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {7093#true} assume true; {7093#true} is VALID [2022-04-27 10:58:14,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#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(9, 2); {7093#true} is VALID [2022-04-27 10:58:14,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {7093#true} call ULTIMATE.init(); {7093#true} is VALID [2022-04-27 10:58:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 13 not checked. [2022-04-27 10:58:14,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515647182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:58:14,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:58:14,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-27 10:58:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608975575] [2022-04-27 10:58:14,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:58:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 60 [2022-04-27 10:58:14,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:58:14,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:58:14,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:14,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 10:58:14,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:58:14,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 10:58:14,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=723, Unknown=6, NotChecked=54, Total=870 [2022-04-27 10:58:14,806 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:58:15,769 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| c_main_~x~0.base) (+ 16 c_main_~x~0.offset)) 0) (<= 5 c_main_~i~0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ 16 c_main_~x~0.offset)) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 10:58:16,211 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 16 c_main_~x~0.offset))) (and (= (select (select |c_#memory_int| c_main_~x~0.base) .cse0) 0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ 16 c_main_~x~0.offset)) 0)) (not (= .cse0 (+ (* c_main_~i~0 4) c_main_~x~0.offset))))) is different from false [2022-04-27 10:58:16,711 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~x~0.base) (+ 16 c_main_~x~0.offset)) 0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ 16 c_main_~x~0.offset)) 0))) is different from false [2022-04-27 10:58:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:17,670 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-27 10:58:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 10:58:17,670 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 60 [2022-04-27 10:58:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:58:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:58:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 73 transitions. [2022-04-27 10:58:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:58:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 73 transitions. [2022-04-27 10:58:17,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 73 transitions. [2022-04-27 10:58:17,759 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:58:17,761 INFO L225 Difference]: With dead ends: 118 [2022-04-27 10:58:17,761 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 10:58:17,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=218, Invalid=1951, Unknown=9, NotChecked=372, Total=2550 [2022-04-27 10:58:17,762 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 60 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:58:17,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 179 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 659 Invalid, 0 Unknown, 126 Unchecked, 0.6s Time] [2022-04-27 10:58:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 10:58:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 69. [2022-04-27 10:58:17,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:58:17,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:58:17,789 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:58:17,789 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:58:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:17,791 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-27 10:58:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-27 10:58:17,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:17,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:17,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 116 states. [2022-04-27 10:58:17,792 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 116 states. [2022-04-27 10:58:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:17,795 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-27 10:58:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-27 10:58:17,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:17,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:17,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:58:17,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:58:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:58:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-27 10:58:17,797 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-27 10:58:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:58:17,797 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-27 10:58:17,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 27 states have internal predecessors, (67), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 10:58:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-27 10:58:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 10:58:17,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:17,798 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:17,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 10:58:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 10:58:18,012 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 13 times [2022-04-27 10:58:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:18,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332357130] [2022-04-27 10:58:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {8080#(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(9, 2); {8038#true} is VALID [2022-04-27 10:58:18,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8038#true} {8038#true} #70#return; {8038#true} is VALID [2022-04-27 10:58:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 10:58:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:58:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 10:58:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 10:58:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-27 10:58:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:18,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {8038#true} call ULTIMATE.init(); {8080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:18,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {8080#(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(9, 2); {8038#true} is VALID [2022-04-27 10:58:18,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8038#true} #70#return; {8038#true} is VALID [2022-04-27 10:58:18,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {8038#true} call #t~ret6 := main(); {8038#true} is VALID [2022-04-27 10:58:18,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {8038#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8038#true} is VALID [2022-04-27 10:58:18,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {8038#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8043#(= main_~i~0 0)} is VALID [2022-04-27 10:58:18,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {8043#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8043#(= main_~i~0 0)} is VALID [2022-04-27 10:58:18,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {8043#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:58:18,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:58:18,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:58:18,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:58:18,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:58:18,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:58:18,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:58:18,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:58:18,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:58:18,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {8048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8049#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:58:18,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {8049#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:58:18,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:58:18,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:18,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:18,330 INFO L272 TraceCheckUtils]: 22: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:58:18,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,331 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8038#true} {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:18,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:58:18,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:18,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:18,332 INFO L272 TraceCheckUtils]: 30: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:58:18,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,333 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8038#true} {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:18,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:18,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:18,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:18,335 INFO L272 TraceCheckUtils]: 38: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:58:18,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,336 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8038#true} {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:18,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:58:18,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:18,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:18,337 INFO L272 TraceCheckUtils]: 46: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:58:18,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,338 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8038#true} {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:18,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:58:18,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:18,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:18,340 INFO L272 TraceCheckUtils]: 54: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:58:18,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:58:18,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:58:18,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:58:18,341 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8038#true} {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:18,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:58:18,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8076#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:58:18,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {8076#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8077#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:58:18,343 INFO L272 TraceCheckUtils]: 62: Hoare triple {8077#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8078#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:58:18,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {8078#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8079#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:58:18,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {8079#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8039#false} is VALID [2022-04-27 10:58:18,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {8039#false} assume !false; {8039#false} is VALID [2022-04-27 10:58:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 10:58:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:58:18,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332357130] [2022-04-27 10:58:18,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332357130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:58:18,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133468071] [2022-04-27 10:58:18,345 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 10:58:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:58:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:58:18,346 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:58:18,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 10:58:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 10:58:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:18,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:58:18,545 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:59:09,567 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 19 treesize of output 7 [2022-04-27 10:59:09,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {8038#true} call ULTIMATE.init(); {8038#true} is VALID [2022-04-27 10:59:09,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#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(9, 2); {8038#true} is VALID [2022-04-27 10:59:09,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:09,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8038#true} #70#return; {8038#true} is VALID [2022-04-27 10:59:09,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {8038#true} call #t~ret6 := main(); {8038#true} is VALID [2022-04-27 10:59:09,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {8038#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8038#true} is VALID [2022-04-27 10:59:09,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {8038#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8043#(= main_~i~0 0)} is VALID [2022-04-27 10:59:09,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {8043#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8043#(= main_~i~0 0)} is VALID [2022-04-27 10:59:09,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {8043#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:59:09,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:59:09,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:59:09,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:59:09,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:59:09,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:59:09,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:59:09,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:59:09,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:59:09,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {8048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:09,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:09,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:09,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:09,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:09,633 INFO L272 TraceCheckUtils]: 22: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} ~cond := #in~cond; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume !(0 == ~cond); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume true; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,634 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:09,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:09,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {8051#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:59:09,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:59:09,636 INFO L272 TraceCheckUtils]: 30: Hoare triple {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} ~cond := #in~cond; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume !(0 == ~cond); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume true; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,638 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} #68#return; {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:59:09,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} havoc #t~mem5; {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 10:59:09,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {8169#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} is VALID [2022-04-27 10:59:09,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} is VALID [2022-04-27 10:59:09,640 INFO L272 TraceCheckUtils]: 38: Hoare triple {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} ~cond := #in~cond; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume !(0 == ~cond); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume true; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,641 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} #68#return; {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} is VALID [2022-04-27 10:59:09,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} havoc #t~mem5; {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} is VALID [2022-04-27 10:59:09,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {8194#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:59:09,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:59:09,643 INFO L272 TraceCheckUtils]: 46: Hoare triple {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,643 INFO L290 TraceCheckUtils]: 47: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} ~cond := #in~cond; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume !(0 == ~cond); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume true; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,644 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} #68#return; {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:59:09,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} havoc #t~mem5; {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 10:59:09,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {8219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 2 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 10:59:09,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 10:59:09,655 INFO L272 TraceCheckUtils]: 54: Hoare triple {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} ~cond := #in~cond; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume !(0 == ~cond); {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} assume true; {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} is VALID [2022-04-27 10:59:09,657 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8150#(exists ((v_main_~x~0.base_BEFORE_CALL_42 Int) (v_main_~x~0.offset_BEFORE_CALL_42 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_42) (+ 20 v_main_~x~0.offset_BEFORE_CALL_42)) 0))} {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} #68#return; {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 10:59:09,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} havoc #t~mem5; {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 10:59:09,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {8244#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8269#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 10:59:09,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {8269#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8077#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:59:09,658 INFO L272 TraceCheckUtils]: 62: Hoare triple {8077#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:59:09,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {8276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:59:09,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {8280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8039#false} is VALID [2022-04-27 10:59:09,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {8039#false} assume !false; {8039#false} is VALID [2022-04-27 10:59:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 10:59:09,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:59:11,885 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:59:11,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 10:59:11,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {8039#false} assume !false; {8039#false} is VALID [2022-04-27 10:59:11,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {8280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8039#false} is VALID [2022-04-27 10:59:11,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {8276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:59:11,989 INFO L272 TraceCheckUtils]: 62: Hoare triple {8077#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:59:11,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {8076#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8077#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:59:11,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8076#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:11,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:11,991 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8038#true} {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:11,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:11,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:59:11,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:59:11,992 INFO L272 TraceCheckUtils]: 54: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:59:11,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:11,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8071#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:11,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:11,993 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8038#true} {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:11,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:11,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:59:11,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:59:11,994 INFO L272 TraceCheckUtils]: 46: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:59:11,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:11,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8066#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:11,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:11,995 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8038#true} {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:11,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:11,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:59:11,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:59:11,996 INFO L272 TraceCheckUtils]: 38: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:59:11,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:11,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8061#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:11,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:11,998 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8038#true} {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:11,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:11,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:59:11,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:59:11,998 INFO L272 TraceCheckUtils]: 30: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:59:11,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:11,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8056#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:11,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 10:59:12,000 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8038#true} {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 10:59:12,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:12,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {8038#true} assume !(0 == ~cond); {8038#true} is VALID [2022-04-27 10:59:12,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {8038#true} ~cond := #in~cond; {8038#true} is VALID [2022-04-27 10:59:12,000 INFO L272 TraceCheckUtils]: 22: Hoare triple {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8038#true} is VALID [2022-04-27 10:59:12,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 10:59:12,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {8398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 10:59:12,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:12,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:12,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {8048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8050#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:12,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:59:12,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:59:12,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:59:12,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:59:12,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:59:12,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:59:12,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:59:12,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:59:12,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {8043#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:59:12,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {8043#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8043#(= main_~i~0 0)} is VALID [2022-04-27 10:59:12,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {8038#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8043#(= main_~i~0 0)} is VALID [2022-04-27 10:59:12,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {8038#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8038#true} is VALID [2022-04-27 10:59:12,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {8038#true} call #t~ret6 := main(); {8038#true} is VALID [2022-04-27 10:59:12,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8038#true} {8038#true} #70#return; {8038#true} is VALID [2022-04-27 10:59:12,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {8038#true} assume true; {8038#true} is VALID [2022-04-27 10:59:12,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#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(9, 2); {8038#true} is VALID [2022-04-27 10:59:12,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {8038#true} call ULTIMATE.init(); {8038#true} is VALID [2022-04-27 10:59:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 10:59:12,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133468071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:59:12,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:59:12,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 29 [2022-04-27 10:59:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518961856] [2022-04-27 10:59:12,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:59:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 66 [2022-04-27 10:59:12,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:59:12,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 10:59:12,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:59:12,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 10:59:12,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:59:12,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 10:59:12,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=727, Unknown=6, NotChecked=0, Total=812 [2022-04-27 10:59:12,099 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 10:59:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:21,439 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2022-04-27 10:59:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 10:59:21,440 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 66 [2022-04-27 10:59:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:59:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 10:59:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 74 transitions. [2022-04-27 10:59:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 10:59:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 74 transitions. [2022-04-27 10:59:21,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 74 transitions. [2022-04-27 10:59:21,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:59:21,513 INFO L225 Difference]: With dead ends: 122 [2022-04-27 10:59:21,513 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 10:59:21,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 126 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=214, Invalid=2128, Unknown=10, NotChecked=0, Total=2352 [2022-04-27 10:59:21,515 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:59:21,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 176 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 639 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2022-04-27 10:59:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 10:59:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 80. [2022-04-27 10:59:21,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:59:21,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 80 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:59:21,556 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 80 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:59:21,557 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 80 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:59:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:21,558 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2022-04-27 10:59:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2022-04-27 10:59:21,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:59:21,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:59:21,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 120 states. [2022-04-27 10:59:21,559 INFO L87 Difference]: Start difference. First operand has 80 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 120 states. [2022-04-27 10:59:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:21,562 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2022-04-27 10:59:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2022-04-27 10:59:21,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:59:21,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:59:21,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:59:21,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:59:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:59:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-04-27 10:59:21,564 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 66 [2022-04-27 10:59:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:59:21,564 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-04-27 10:59:21,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 26 states have internal predecessors, (66), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 10:59:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-04-27 10:59:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 10:59:21,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:59:21,565 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:59:21,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 10:59:21,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:59:21,779 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:59:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:59:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1899556638, now seen corresponding path program 14 times [2022-04-27 10:59:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:59:21,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924332354] [2022-04-27 10:59:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:59:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:59:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:59:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {9096#(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(9, 2); {9053#true} is VALID [2022-04-27 10:59:22,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9053#true} {9053#true} #70#return; {9053#true} is VALID [2022-04-27 10:59:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:59:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:22,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:59:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-27 10:59:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:59:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-27 10:59:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:22,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {9053#true} call ULTIMATE.init(); {9096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:59:22,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {9096#(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(9, 2); {9053#true} is VALID [2022-04-27 10:59:22,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9053#true} #70#return; {9053#true} is VALID [2022-04-27 10:59:22,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {9053#true} call #t~ret6 := main(); {9053#true} is VALID [2022-04-27 10:59:22,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {9053#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9053#true} is VALID [2022-04-27 10:59:22,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {9053#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {9058#(= main_~i~0 0)} is VALID [2022-04-27 10:59:22,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {9058#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9058#(= main_~i~0 0)} is VALID [2022-04-27 10:59:22,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {9058#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:59:22,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:59:22,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:59:22,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:59:22,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:59:22,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:59:22,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:59:22,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:59:22,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9063#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:59:22,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {9063#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9064#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:59:22,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {9064#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9065#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 10:59:22,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {9065#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:22,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:22,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 10:59:22,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:22,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:22,115 INFO L272 TraceCheckUtils]: 24: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 10:59:22,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,116 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9053#true} {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:22,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 10:59:22,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:22,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:22,117 INFO L272 TraceCheckUtils]: 32: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 10:59:22,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,118 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9053#true} {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:22,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:22,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:22,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:22,120 INFO L272 TraceCheckUtils]: 40: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 10:59:22,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,121 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9053#true} {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:22,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 10:59:22,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:22,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:22,122 INFO L272 TraceCheckUtils]: 48: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 10:59:22,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,123 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9053#true} {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:22,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 10:59:22,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:22,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:22,125 INFO L272 TraceCheckUtils]: 56: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 10:59:22,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 10:59:22,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 10:59:22,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 10:59:22,126 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9053#true} {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:22,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 10:59:22,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9092#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 10:59:22,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {9092#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9093#(= |main_#t~mem5| 0)} is VALID [2022-04-27 10:59:22,128 INFO L272 TraceCheckUtils]: 64: Hoare triple {9093#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9094#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:59:22,128 INFO L290 TraceCheckUtils]: 65: Hoare triple {9094#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9095#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:59:22,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {9095#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9054#false} is VALID [2022-04-27 10:59:22,129 INFO L290 TraceCheckUtils]: 67: Hoare triple {9054#false} assume !false; {9054#false} is VALID [2022-04-27 10:59:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 10:59:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:59:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924332354] [2022-04-27 10:59:22,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924332354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:59:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429788154] [2022-04-27 10:59:22,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:59:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:59:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:59:22,132 INFO L229 MonitoredProcess]: Starting monitored process 16 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:59:22,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 10:59:22,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:59:22,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:59:22,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 10:59:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:22,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:59:22,318 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:59:22,534 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-04-27 10:59:22,535 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 27 treesize of output 26 [2022-04-27 11:00:13,589 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 19 treesize of output 7 [2022-04-27 11:00:13,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {9053#true} call ULTIMATE.init(); {9053#true} is VALID [2022-04-27 11:00:13,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#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(9, 2); {9053#true} is VALID [2022-04-27 11:00:13,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:13,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9053#true} #70#return; {9053#true} is VALID [2022-04-27 11:00:13,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {9053#true} call #t~ret6 := main(); {9053#true} is VALID [2022-04-27 11:00:13,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {9053#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9053#true} is VALID [2022-04-27 11:00:13,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {9053#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {9058#(= main_~i~0 0)} is VALID [2022-04-27 11:00:13,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {9058#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9058#(= main_~i~0 0)} is VALID [2022-04-27 11:00:13,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {9058#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:00:13,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:00:13,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:00:13,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:00:13,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:00:13,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:00:13,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:00:13,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:00:13,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9063#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:00:13,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {9063#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9064#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:00:13,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {9064#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9154#(exists ((v_main_~i~0_115 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_115))) 0) (<= v_main_~i~0_115 5) (<= 5 v_main_~i~0_115) (<= (+ v_main_~i~0_115 1) main_~i~0)))} is VALID [2022-04-27 11:00:13,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {9154#(exists ((v_main_~i~0_115 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_115))) 0) (<= v_main_~i~0_115 5) (<= 5 v_main_~i~0_115) (<= (+ v_main_~i~0_115 1) main_~i~0)))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:13,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:13,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:13,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:13,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:13,652 INFO L272 TraceCheckUtils]: 24: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} ~cond := #in~cond; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume !(0 == ~cond); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume true; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,654 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:13,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:13,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {9067#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:00:13,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:00:13,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} ~cond := #in~cond; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume !(0 == ~cond); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume true; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,657 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} #68#return; {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:00:13,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} havoc #t~mem5; {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:00:13,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {9192#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,659 INFO L272 TraceCheckUtils]: 40: Hoare triple {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} ~cond := #in~cond; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume !(0 == ~cond); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume true; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,661 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #68#return; {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} havoc #t~mem5; {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {9217#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,663 INFO L272 TraceCheckUtils]: 48: Hoare triple {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} ~cond := #in~cond; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume !(0 == ~cond); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume true; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,664 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #68#return; {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} havoc #t~mem5; {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {9242#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,666 INFO L272 TraceCheckUtils]: 56: Hoare triple {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} ~cond := #in~cond; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume !(0 == ~cond); {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} assume true; {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} is VALID [2022-04-27 11:00:13,667 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9173#(exists ((v_main_~x~0.base_BEFORE_CALL_52 Int) (v_main_~x~0.offset_BEFORE_CALL_52 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_52) (+ 20 v_main_~x~0.offset_BEFORE_CALL_52)) 0))} {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #68#return; {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} havoc #t~mem5; {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {9267#(and (= (+ main_~i~1 (- 3)) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9292#(and (= 1 (+ main_~i~1 (- 4))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:13,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {9292#(and (= 1 (+ main_~i~1 (- 4))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9093#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:00:13,669 INFO L272 TraceCheckUtils]: 64: Hoare triple {9093#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:13,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {9299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:00:13,670 INFO L290 TraceCheckUtils]: 66: Hoare triple {9303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9054#false} is VALID [2022-04-27 11:00:13,670 INFO L290 TraceCheckUtils]: 67: Hoare triple {9054#false} assume !false; {9054#false} is VALID [2022-04-27 11:00:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:00:13,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:00:16,007 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 11:00:16,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 11:00:16,115 INFO L290 TraceCheckUtils]: 67: Hoare triple {9054#false} assume !false; {9054#false} is VALID [2022-04-27 11:00:16,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {9303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9054#false} is VALID [2022-04-27 11:00:16,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {9299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:00:16,116 INFO L272 TraceCheckUtils]: 64: Hoare triple {9093#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:16,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {9092#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9093#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:00:16,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9092#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:16,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:16,118 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9053#true} {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:16,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:16,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 11:00:16,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 11:00:16,118 INFO L272 TraceCheckUtils]: 56: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 11:00:16,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:16,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9087#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:16,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:16,120 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9053#true} {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:16,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:16,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 11:00:16,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 11:00:16,120 INFO L272 TraceCheckUtils]: 48: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 11:00:16,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:16,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9082#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:16,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:16,122 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9053#true} {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:16,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:16,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 11:00:16,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 11:00:16,123 INFO L272 TraceCheckUtils]: 40: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 11:00:16,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:16,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9077#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:16,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:16,124 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9053#true} {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:16,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:16,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 11:00:16,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 11:00:16,125 INFO L272 TraceCheckUtils]: 32: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 11:00:16,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:16,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9072#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:16,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:00:16,126 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9053#true} {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:00:16,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:16,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {9053#true} assume !(0 == ~cond); {9053#true} is VALID [2022-04-27 11:00:16,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {9053#true} ~cond := #in~cond; {9053#true} is VALID [2022-04-27 11:00:16,127 INFO L272 TraceCheckUtils]: 24: Hoare triple {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9053#true} is VALID [2022-04-27 11:00:16,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:00:16,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {9421#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:00:16,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:16,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:16,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {9065#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9066#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:16,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {9458#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (not (<= main_~i~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9065#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:16,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {9063#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9458#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (not (<= main_~i~0 4)))} is VALID [2022-04-27 11:00:16,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9063#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:00:16,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:00:16,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9062#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:00:16,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:00:16,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9061#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:00:16,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:00:16,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9060#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:00:16,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:00:16,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {9058#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9059#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:00:16,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {9058#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {9058#(= main_~i~0 0)} is VALID [2022-04-27 11:00:16,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {9053#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {9058#(= main_~i~0 0)} is VALID [2022-04-27 11:00:16,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {9053#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9053#true} is VALID [2022-04-27 11:00:16,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {9053#true} call #t~ret6 := main(); {9053#true} is VALID [2022-04-27 11:00:16,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9053#true} {9053#true} #70#return; {9053#true} is VALID [2022-04-27 11:00:16,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {9053#true} assume true; {9053#true} is VALID [2022-04-27 11:00:16,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {9053#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(9, 2); {9053#true} is VALID [2022-04-27 11:00:16,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {9053#true} call ULTIMATE.init(); {9053#true} is VALID [2022-04-27 11:00:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:00:16,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429788154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:00:16,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:00:16,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 32 [2022-04-27 11:00:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141884012] [2022-04-27 11:00:16,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:00:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 68 [2022-04-27 11:00:16,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:16,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:00:16,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:16,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:00:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:16,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:00:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=892, Unknown=6, NotChecked=0, Total=992 [2022-04-27 11:00:16,218 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:00:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:18,560 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2022-04-27 11:00:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 11:00:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 68 [2022-04-27 11:00:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:00:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 82 transitions. [2022-04-27 11:00:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:00:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 82 transitions. [2022-04-27 11:00:18,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 82 transitions. [2022-04-27 11:00:18,650 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 11:00:18,653 INFO L225 Difference]: With dead ends: 159 [2022-04-27 11:00:18,653 INFO L226 Difference]: Without dead ends: 157 [2022-04-27 11:00:18,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 122 SyntacticMatches, 15 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=227, Invalid=2317, Unknown=6, NotChecked=0, Total=2550 [2022-04-27 11:00:18,655 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:18,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 248 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 957 Invalid, 0 Unknown, 77 Unchecked, 0.9s Time] [2022-04-27 11:00:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-27 11:00:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 127. [2022-04-27 11:00:18,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:18,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 127 states, 97 states have (on average 1.041237113402062) internal successors, (101), 100 states have internal predecessors, (101), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:00:18,735 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 127 states, 97 states have (on average 1.041237113402062) internal successors, (101), 100 states have internal predecessors, (101), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:00:18,736 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 127 states, 97 states have (on average 1.041237113402062) internal successors, (101), 100 states have internal predecessors, (101), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:00:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:18,739 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2022-04-27 11:00:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2022-04-27 11:00:18,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:18,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:18,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 97 states have (on average 1.041237113402062) internal successors, (101), 100 states have internal predecessors, (101), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 157 states. [2022-04-27 11:00:18,740 INFO L87 Difference]: Start difference. First operand has 127 states, 97 states have (on average 1.041237113402062) internal successors, (101), 100 states have internal predecessors, (101), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 157 states. [2022-04-27 11:00:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:18,745 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2022-04-27 11:00:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2022-04-27 11:00:18,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:18,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:18,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:18,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.041237113402062) internal successors, (101), 100 states have internal predecessors, (101), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:00:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2022-04-27 11:00:18,750 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 68 [2022-04-27 11:00:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:18,750 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2022-04-27 11:00:18,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 29 states have internal predecessors, (70), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:00:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2022-04-27 11:00:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 11:00:18,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:18,752 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:18,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:00:18,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:00:18,967 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1958520000, now seen corresponding path program 15 times [2022-04-27 11:00:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:18,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306295046] [2022-04-27 11:00:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {10316#(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(9, 2); {10272#true} is VALID [2022-04-27 11:00:19,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10272#true} {10272#true} #70#return; {10272#true} is VALID [2022-04-27 11:00:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 11:00:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-27 11:00:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 11:00:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-27 11:00:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:19,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-27 11:00:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:19,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {10272#true} call ULTIMATE.init(); {10316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:19,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {10316#(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(9, 2); {10272#true} is VALID [2022-04-27 11:00:19,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10272#true} #70#return; {10272#true} is VALID [2022-04-27 11:00:19,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {10272#true} call #t~ret6 := main(); {10272#true} is VALID [2022-04-27 11:00:19,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {10272#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10272#true} is VALID [2022-04-27 11:00:19,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {10272#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10277#(= main_~i~0 0)} is VALID [2022-04-27 11:00:19,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {10277#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10277#(= main_~i~0 0)} is VALID [2022-04-27 11:00:19,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {10277#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:00:19,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:00:19,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:00:19,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:00:19,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:00:19,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:00:19,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:00:19,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:00:19,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10282#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:00:19,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {10282#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10283#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:00:19,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {10283#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10284#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (<= 6 main_~i~0))} is VALID [2022-04-27 11:00:19,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {10284#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10284#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (<= 6 main_~i~0))} is VALID [2022-04-27 11:00:19,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {10284#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10285#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:00:19,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {10285#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:19,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:19,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:00:19,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:19,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:19,363 INFO L272 TraceCheckUtils]: 26: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:00:19,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,364 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10272#true} {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:19,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:00:19,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:19,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:19,365 INFO L272 TraceCheckUtils]: 34: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:00:19,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,366 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10272#true} {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:19,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:19,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:19,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:19,367 INFO L272 TraceCheckUtils]: 42: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:00:19,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,368 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10272#true} {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:19,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:00:19,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:19,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:19,369 INFO L272 TraceCheckUtils]: 50: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:00:19,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,370 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10272#true} {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:19,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:00:19,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:19,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:19,371 INFO L272 TraceCheckUtils]: 58: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:00:19,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:00:19,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:00:19,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:00:19,372 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10272#true} {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:19,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:00:19,373 INFO L290 TraceCheckUtils]: 64: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10312#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:00:19,373 INFO L290 TraceCheckUtils]: 65: Hoare triple {10312#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10313#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:00:19,374 INFO L272 TraceCheckUtils]: 66: Hoare triple {10313#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10314#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:00:19,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {10314#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10315#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:00:19,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {10315#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10273#false} is VALID [2022-04-27 11:00:19,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {10273#false} assume !false; {10273#false} is VALID [2022-04-27 11:00:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 10 proven. 114 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:00:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306295046] [2022-04-27 11:00:19,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306295046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:00:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586635219] [2022-04-27 11:00:19,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:00:19,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:00:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:00:19,380 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:00:19,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:00:19,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-27 11:00:19,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:00:19,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 11:00:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:19,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:00:19,599 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 11:00:19,720 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 11:00:19,720 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 25 treesize of output 24 [2022-04-27 11:00:19,747 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 11:00:19,748 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 25 treesize of output 24 [2022-04-27 11:01:09,359 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 19 treesize of output 7 [2022-04-27 11:01:09,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {10272#true} call ULTIMATE.init(); {10272#true} is VALID [2022-04-27 11:01:09,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#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(9, 2); {10272#true} is VALID [2022-04-27 11:01:09,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:09,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10272#true} #70#return; {10272#true} is VALID [2022-04-27 11:01:09,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {10272#true} call #t~ret6 := main(); {10272#true} is VALID [2022-04-27 11:01:09,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {10272#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10272#true} is VALID [2022-04-27 11:01:09,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {10272#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10277#(= main_~i~0 0)} is VALID [2022-04-27 11:01:09,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {10277#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10277#(= main_~i~0 0)} is VALID [2022-04-27 11:01:09,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {10277#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:01:09,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:01:09,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:01:09,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:01:09,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:01:09,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:01:09,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:01:09,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:01:09,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10282#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:01:09,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {10282#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10283#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:01:09,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {10283#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10284#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (<= 6 main_~i~0))} is VALID [2022-04-27 11:01:09,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {10284#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:09,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:09,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:09,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:09,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:09,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:01:09,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:01:09,421 INFO L272 TraceCheckUtils]: 26: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} ~cond := #in~cond; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume !(0 == ~cond); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume true; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,423 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:01:09,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:01:09,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {10287#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:01:09,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:01:09,425 INFO L272 TraceCheckUtils]: 34: Hoare triple {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} ~cond := #in~cond; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume !(0 == ~cond); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume true; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,426 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:01:09,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:01:09,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {10417#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,428 INFO L272 TraceCheckUtils]: 42: Hoare triple {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} ~cond := #in~cond; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume !(0 == ~cond); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume true; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,429 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #68#return; {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} havoc #t~mem5; {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {10442#(and (= (+ (- 2) main_~i~1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,431 INFO L272 TraceCheckUtils]: 50: Hoare triple {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} ~cond := #in~cond; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume !(0 == ~cond); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume true; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,433 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #68#return; {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} havoc #t~mem5; {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {10467#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:01:09,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:01:09,435 INFO L272 TraceCheckUtils]: 58: Hoare triple {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} ~cond := #in~cond; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume !(0 == ~cond); {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} assume true; {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} is VALID [2022-04-27 11:01:09,436 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10398#(exists ((v_main_~x~0.base_BEFORE_CALL_62 Int) (v_main_~x~0.offset_BEFORE_CALL_62 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_62) (+ 20 v_main_~x~0.offset_BEFORE_CALL_62)) 0))} {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} #68#return; {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:01:09,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} havoc #t~mem5; {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:01:09,437 INFO L290 TraceCheckUtils]: 64: Hoare triple {10492#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10517#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:09,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {10517#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10313#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:01:09,438 INFO L272 TraceCheckUtils]: 66: Hoare triple {10313#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:09,438 INFO L290 TraceCheckUtils]: 67: Hoare triple {10524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:09,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {10528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10273#false} is VALID [2022-04-27 11:01:09,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {10273#false} assume !false; {10273#false} is VALID [2022-04-27 11:01:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 11:01:09,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:12,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 20)) 0)) is different from false [2022-04-27 11:01:12,226 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 11:01:12,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 11:01:12,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {10273#false} assume !false; {10273#false} is VALID [2022-04-27 11:01:12,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {10528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10273#false} is VALID [2022-04-27 11:01:12,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {10524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:12,335 INFO L272 TraceCheckUtils]: 66: Hoare triple {10313#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:12,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {10312#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10313#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:01:12,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10312#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:12,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:12,337 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10272#true} {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:12,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:12,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:01:12,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:01:12,337 INFO L272 TraceCheckUtils]: 58: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:01:12,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:12,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10307#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:12,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:12,341 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10272#true} {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:12,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:12,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:01:12,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:01:12,341 INFO L272 TraceCheckUtils]: 50: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:01:12,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:12,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10302#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:12,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:12,343 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10272#true} {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:12,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:12,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:01:12,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:01:12,343 INFO L272 TraceCheckUtils]: 42: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:01:12,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:12,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10297#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:12,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:12,345 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10272#true} {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:12,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:12,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:01:12,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:01:12,345 INFO L272 TraceCheckUtils]: 34: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:01:12,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:12,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10292#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:12,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:12,347 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10272#true} {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:12,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:12,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {10272#true} assume !(0 == ~cond); {10272#true} is VALID [2022-04-27 11:01:12,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {10272#true} ~cond := #in~cond; {10272#true} is VALID [2022-04-27 11:01:12,347 INFO L272 TraceCheckUtils]: 26: Hoare triple {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10272#true} is VALID [2022-04-27 11:01:12,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:12,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {10646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:12,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:12,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:12,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {10680#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 20)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-27 11:01:12,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {10680#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 20)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10680#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:12,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {10285#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10680#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:12,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {10690#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (not (<= main_~i~0 4)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10285#(and (not (= (+ main_~x~0.offset 20) (+ main_~x~0.offset (* main_~i~0 4)))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0))} is VALID [2022-04-27 11:01:12,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {10282#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10690#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (not (<= main_~i~0 4)))} is VALID [2022-04-27 11:01:12,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10282#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:01:12,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:01:12,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10281#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:01:12,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:01:12,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10280#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:01:12,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:01:12,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10279#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:01:12,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:01:12,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {10277#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10278#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:01:12,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {10277#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10277#(= main_~i~0 0)} is VALID [2022-04-27 11:01:12,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {10272#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10277#(= main_~i~0 0)} is VALID [2022-04-27 11:01:12,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {10272#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10272#true} is VALID [2022-04-27 11:01:12,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {10272#true} call #t~ret6 := main(); {10272#true} is VALID [2022-04-27 11:01:12,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10272#true} {10272#true} #70#return; {10272#true} is VALID [2022-04-27 11:01:12,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {10272#true} assume true; {10272#true} is VALID [2022-04-27 11:01:12,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {10272#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(9, 2); {10272#true} is VALID [2022-04-27 11:01:12,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {10272#true} call ULTIMATE.init(); {10272#true} is VALID [2022-04-27 11:01:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 40 trivial. 15 not checked. [2022-04-27 11:01:12,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586635219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:12,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:12,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-04-27 11:01:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291949880] [2022-04-27 11:01:12,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 70 [2022-04-27 11:01:12,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:12,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:01:12,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:12,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:01:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:12,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:01:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=893, Unknown=7, NotChecked=60, Total=1056 [2022-04-27 11:01:12,445 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:01:13,454 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset 20)) 0) (<= 6 c_main_~i~0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 20)) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 11:01:13,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0.offset 20))) (and (= (select (select |c_#memory_int| c_main_~x~0.base) .cse0) 0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 20)) 0)) (not (= .cse0 (+ (* c_main_~i~0 4) c_main_~x~0.offset))))) is different from false [2022-04-27 11:01:14,426 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset 20)) 0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 20)) 0))) is different from false [2022-04-27 11:01:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:15,457 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-04-27 11:01:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 11:01:15,458 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 70 [2022-04-27 11:01:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:01:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-27 11:01:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:01:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-27 11:01:15,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 85 transitions. [2022-04-27 11:01:15,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:15,563 INFO L225 Difference]: With dead ends: 155 [2022-04-27 11:01:15,563 INFO L226 Difference]: Without dead ends: 153 [2022-04-27 11:01:15,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 127 SyntacticMatches, 16 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=254, Invalid=2508, Unknown=10, NotChecked=420, Total=3192 [2022-04-27 11:01:15,565 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:15,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 209 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 821 Invalid, 0 Unknown, 134 Unchecked, 0.7s Time] [2022-04-27 11:01:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-27 11:01:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2022-04-27 11:01:15,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:15,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 139 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:01:15,643 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 139 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:01:15,643 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 139 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:01:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:15,646 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2022-04-27 11:01:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2022-04-27 11:01:15,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:15,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:15,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 153 states. [2022-04-27 11:01:15,647 INFO L87 Difference]: Start difference. First operand has 139 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 153 states. [2022-04-27 11:01:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:15,651 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2022-04-27 11:01:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2022-04-27 11:01:15,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:15,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:15,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:15,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:01:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2022-04-27 11:01:15,654 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 70 [2022-04-27 11:01:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:15,654 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2022-04-27 11:01:15,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 11:01:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2022-04-27 11:01:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 11:01:15,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:15,656 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:15,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 11:01:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:01:15,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 16 times [2022-04-27 11:01:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:15,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920522131] [2022-04-27 11:01:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {11562#(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(9, 2); {11518#true} is VALID [2022-04-27 11:01:16,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11518#true} {11518#true} #70#return; {11518#true} is VALID [2022-04-27 11:01:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 11:01:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-27 11:01:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 11:01:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11536#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:01:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11541#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:01:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11546#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-27 11:01:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11551#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-27 11:01:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11556#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:16,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {11518#true} call ULTIMATE.init(); {11562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:16,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {11562#(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(9, 2); {11518#true} is VALID [2022-04-27 11:01:16,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11518#true} #70#return; {11518#true} is VALID [2022-04-27 11:01:16,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {11518#true} call #t~ret6 := main(); {11518#true} is VALID [2022-04-27 11:01:16,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {11518#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11518#true} is VALID [2022-04-27 11:01:16,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {11518#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11523#(= main_~i~0 0)} is VALID [2022-04-27 11:01:16,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {11523#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11523#(= main_~i~0 0)} is VALID [2022-04-27 11:01:16,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {11523#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11524#(<= main_~i~0 1)} is VALID [2022-04-27 11:01:16,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {11524#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11524#(<= main_~i~0 1)} is VALID [2022-04-27 11:01:16,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {11524#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11525#(<= main_~i~0 2)} is VALID [2022-04-27 11:01:16,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {11525#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11525#(<= main_~i~0 2)} is VALID [2022-04-27 11:01:16,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {11525#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11526#(<= main_~i~0 3)} is VALID [2022-04-27 11:01:16,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {11526#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11526#(<= main_~i~0 3)} is VALID [2022-04-27 11:01:16,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {11526#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11527#(<= main_~i~0 4)} is VALID [2022-04-27 11:01:16,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {11527#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11527#(<= main_~i~0 4)} is VALID [2022-04-27 11:01:16,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {11527#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11528#(<= main_~i~0 5)} is VALID [2022-04-27 11:01:16,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {11528#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11528#(<= main_~i~0 5)} is VALID [2022-04-27 11:01:16,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {11528#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11529#(<= main_~i~0 6)} is VALID [2022-04-27 11:01:16,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {11529#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {11530#(<= main_~n~0 6)} is VALID [2022-04-27 11:01:16,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {11530#(<= main_~n~0 6)} ~i~1 := 0; {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-27 11:01:16,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-27 11:01:16,068 INFO L272 TraceCheckUtils]: 22: Hoare triple {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11518#true} {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-27 11:01:16,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} havoc #t~mem5; {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-27 11:01:16,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {11531#(and (<= main_~n~0 6) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:16,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:16,070 INFO L272 TraceCheckUtils]: 30: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,071 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11518#true} {11536#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:16,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:16,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:16,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:16,072 INFO L272 TraceCheckUtils]: 38: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,073 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11518#true} {11541#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:16,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:16,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:16,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:16,074 INFO L272 TraceCheckUtils]: 46: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,075 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11518#true} {11546#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:16,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:16,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:16,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:16,076 INFO L272 TraceCheckUtils]: 54: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,077 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11518#true} {11551#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:16,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:16,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:16,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:16,078 INFO L272 TraceCheckUtils]: 62: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,078 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11518#true} {11556#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:16,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:16,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11561#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 11:01:16,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {11561#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11519#false} is VALID [2022-04-27 11:01:16,080 INFO L272 TraceCheckUtils]: 70: Hoare triple {11519#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11519#false} is VALID [2022-04-27 11:01:16,080 INFO L290 TraceCheckUtils]: 71: Hoare triple {11519#false} ~cond := #in~cond; {11519#false} is VALID [2022-04-27 11:01:16,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {11519#false} assume 0 == ~cond; {11519#false} is VALID [2022-04-27 11:01:16,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {11519#false} assume !false; {11519#false} is VALID [2022-04-27 11:01:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:01:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920522131] [2022-04-27 11:01:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920522131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:16,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396800126] [2022-04-27 11:01:16,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:01:16,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:16,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:16,084 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:01:16,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:01:16,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:01:16,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:01:16,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:01:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:16,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:16,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {11518#true} call ULTIMATE.init(); {11518#true} is VALID [2022-04-27 11:01:16,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#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(9, 2); {11518#true} is VALID [2022-04-27 11:01:16,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11518#true} #70#return; {11518#true} is VALID [2022-04-27 11:01:16,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {11518#true} call #t~ret6 := main(); {11518#true} is VALID [2022-04-27 11:01:16,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {11518#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11518#true} is VALID [2022-04-27 11:01:16,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {11518#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11584#(<= main_~i~0 0)} is VALID [2022-04-27 11:01:16,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {11584#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11584#(<= main_~i~0 0)} is VALID [2022-04-27 11:01:16,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {11584#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11524#(<= main_~i~0 1)} is VALID [2022-04-27 11:01:16,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {11524#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11524#(<= main_~i~0 1)} is VALID [2022-04-27 11:01:16,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {11524#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11525#(<= main_~i~0 2)} is VALID [2022-04-27 11:01:16,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {11525#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11525#(<= main_~i~0 2)} is VALID [2022-04-27 11:01:16,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {11525#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11526#(<= main_~i~0 3)} is VALID [2022-04-27 11:01:16,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {11526#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11526#(<= main_~i~0 3)} is VALID [2022-04-27 11:01:16,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {11526#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11527#(<= main_~i~0 4)} is VALID [2022-04-27 11:01:16,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {11527#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11527#(<= main_~i~0 4)} is VALID [2022-04-27 11:01:16,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {11527#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11528#(<= main_~i~0 5)} is VALID [2022-04-27 11:01:16,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {11528#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11528#(<= main_~i~0 5)} is VALID [2022-04-27 11:01:16,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {11528#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11529#(<= main_~i~0 6)} is VALID [2022-04-27 11:01:16,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {11529#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {11530#(<= main_~n~0 6)} is VALID [2022-04-27 11:01:16,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {11530#(<= main_~n~0 6)} ~i~1 := 0; {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-27 11:01:16,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-27 11:01:16,718 INFO L272 TraceCheckUtils]: 22: Hoare triple {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,719 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11518#true} {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #68#return; {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-27 11:01:16,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} havoc #t~mem5; {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-27 11:01:16,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {11627#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-27 11:01:16,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-27 11:01:16,720 INFO L272 TraceCheckUtils]: 30: Hoare triple {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,721 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11518#true} {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #68#return; {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-27 11:01:16,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} havoc #t~mem5; {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-27 11:01:16,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {11652#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-27 11:01:16,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-27 11:01:16,722 INFO L272 TraceCheckUtils]: 38: Hoare triple {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,722 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11518#true} {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #68#return; {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-27 11:01:16,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} havoc #t~mem5; {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-27 11:01:16,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {11677#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-27 11:01:16,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-27 11:01:16,726 INFO L272 TraceCheckUtils]: 46: Hoare triple {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,726 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11518#true} {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #68#return; {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-27 11:01:16,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} havoc #t~mem5; {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-27 11:01:16,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {11702#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-27 11:01:16,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-27 11:01:16,728 INFO L272 TraceCheckUtils]: 54: Hoare triple {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,728 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11518#true} {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #68#return; {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-27 11:01:16,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} havoc #t~mem5; {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-27 11:01:16,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {11727#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-27 11:01:16,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-27 11:01:16,729 INFO L272 TraceCheckUtils]: 62: Hoare triple {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:16,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:16,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:16,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:16,730 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11518#true} {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #68#return; {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-27 11:01:16,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} havoc #t~mem5; {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-27 11:01:16,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {11752#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11777#(and (<= main_~n~0 6) (<= 6 main_~i~1))} is VALID [2022-04-27 11:01:16,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {11777#(and (<= main_~n~0 6) (<= 6 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11519#false} is VALID [2022-04-27 11:01:16,731 INFO L272 TraceCheckUtils]: 70: Hoare triple {11519#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11519#false} is VALID [2022-04-27 11:01:16,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {11519#false} ~cond := #in~cond; {11519#false} is VALID [2022-04-27 11:01:16,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {11519#false} assume 0 == ~cond; {11519#false} is VALID [2022-04-27 11:01:16,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {11519#false} assume !false; {11519#false} is VALID [2022-04-27 11:01:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:01:16,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:17,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {11519#false} assume !false; {11519#false} is VALID [2022-04-27 11:01:17,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {11519#false} assume 0 == ~cond; {11519#false} is VALID [2022-04-27 11:01:17,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {11519#false} ~cond := #in~cond; {11519#false} is VALID [2022-04-27 11:01:17,068 INFO L272 TraceCheckUtils]: 70: Hoare triple {11519#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11519#false} is VALID [2022-04-27 11:01:17,068 INFO L290 TraceCheckUtils]: 69: Hoare triple {11561#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11519#false} is VALID [2022-04-27 11:01:17,069 INFO L290 TraceCheckUtils]: 68: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11561#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 11:01:17,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:17,070 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11518#true} {11556#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:17,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:17,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:17,070 INFO L272 TraceCheckUtils]: 62: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:17,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {11556#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:17,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11556#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:01:17,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:17,072 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11518#true} {11551#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:17,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:17,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:17,072 INFO L272 TraceCheckUtils]: 54: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:17,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {11551#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:17,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11551#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:01:17,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:17,074 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11518#true} {11546#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:17,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:17,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:17,074 INFO L272 TraceCheckUtils]: 46: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:17,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {11546#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:17,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:01:17,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:17,075 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11518#true} {11541#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:17,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:17,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:17,076 INFO L272 TraceCheckUtils]: 38: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:17,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {11541#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:17,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11541#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:01:17,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:17,077 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11518#true} {11536#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:17,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:17,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:17,077 INFO L272 TraceCheckUtils]: 30: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:17,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:17,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {11928#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11536#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:01:17,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {11928#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11928#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:01:17,079 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11518#true} {11928#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11928#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:01:17,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {11518#true} assume !(0 == ~cond); {11518#true} is VALID [2022-04-27 11:01:17,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {11518#true} ~cond := #in~cond; {11518#true} is VALID [2022-04-27 11:01:17,079 INFO L272 TraceCheckUtils]: 22: Hoare triple {11928#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11518#true} is VALID [2022-04-27 11:01:17,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {11928#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11928#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:01:17,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {11530#(<= main_~n~0 6)} ~i~1 := 0; {11928#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:01:17,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {11529#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {11530#(<= main_~n~0 6)} is VALID [2022-04-27 11:01:17,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {11528#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11529#(<= main_~i~0 6)} is VALID [2022-04-27 11:01:17,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {11528#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11528#(<= main_~i~0 5)} is VALID [2022-04-27 11:01:17,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {11527#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11528#(<= main_~i~0 5)} is VALID [2022-04-27 11:01:17,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {11527#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11527#(<= main_~i~0 4)} is VALID [2022-04-27 11:01:17,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {11526#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11527#(<= main_~i~0 4)} is VALID [2022-04-27 11:01:17,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {11526#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11526#(<= main_~i~0 3)} is VALID [2022-04-27 11:01:17,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {11525#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11526#(<= main_~i~0 3)} is VALID [2022-04-27 11:01:17,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {11525#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11525#(<= main_~i~0 2)} is VALID [2022-04-27 11:01:17,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {11524#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11525#(<= main_~i~0 2)} is VALID [2022-04-27 11:01:17,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {11524#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11524#(<= main_~i~0 1)} is VALID [2022-04-27 11:01:17,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {11584#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11524#(<= main_~i~0 1)} is VALID [2022-04-27 11:01:17,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {11584#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11584#(<= main_~i~0 0)} is VALID [2022-04-27 11:01:17,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {11518#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11584#(<= main_~i~0 0)} is VALID [2022-04-27 11:01:17,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {11518#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11518#true} is VALID [2022-04-27 11:01:17,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {11518#true} call #t~ret6 := main(); {11518#true} is VALID [2022-04-27 11:01:17,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11518#true} {11518#true} #70#return; {11518#true} is VALID [2022-04-27 11:01:17,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {11518#true} assume true; {11518#true} is VALID [2022-04-27 11:01:17,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {11518#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(9, 2); {11518#true} is VALID [2022-04-27 11:01:17,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {11518#true} call ULTIMATE.init(); {11518#true} is VALID [2022-04-27 11:01:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:01:17,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396800126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:17,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-04-27 11:01:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017490118] [2022-04-27 11:01:17,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:17,086 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 74 [2022-04-27 11:01:17,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:17,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:01:17,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:17,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 11:01:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 11:01:17,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:01:17,152 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:01:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:17,898 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-04-27 11:01:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:01:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 74 [2022-04-27 11:01:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:01:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-27 11:01:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:01:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-27 11:01:17,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-27 11:01:17,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:17,979 INFO L225 Difference]: With dead ends: 156 [2022-04-27 11:01:17,980 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 11:01:17,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1365, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:01:17,983 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:17,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:01:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 11:01:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-27 11:01:18,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:18,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 91 states have internal predecessors, (92), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:01:18,044 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 91 states have internal predecessors, (92), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:01:18,044 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 91 states have internal predecessors, (92), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:01:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:18,047 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-27 11:01:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-27 11:01:18,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:18,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:18,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 91 states have internal predecessors, (92), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 116 states. [2022-04-27 11:01:18,048 INFO L87 Difference]: Start difference. First operand has 116 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 91 states have internal predecessors, (92), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 116 states. [2022-04-27 11:01:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:18,050 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-27 11:01:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-27 11:01:18,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:18,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:18,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:18,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 91 states have internal predecessors, (92), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:01:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2022-04-27 11:01:18,053 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 74 [2022-04-27 11:01:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:18,053 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2022-04-27 11:01:18,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 15 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:01:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-27 11:01:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 11:01:18,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:18,054 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:18,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 11:01:18,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:01:18,278 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 17 times [2022-04-27 11:01:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:18,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480227916] [2022-04-27 11:01:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {12710#(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(9, 2); {12662#true} is VALID [2022-04-27 11:01:18,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12662#true} {12662#true} #70#return; {12662#true} is VALID [2022-04-27 11:01:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 11:01:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:01:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 11:01:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-27 11:01:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 11:01:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-27 11:01:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:18,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-27 11:01:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:18,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {12662#true} call ULTIMATE.init(); {12710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:18,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {12710#(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(9, 2); {12662#true} is VALID [2022-04-27 11:01:18,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12662#true} #70#return; {12662#true} is VALID [2022-04-27 11:01:18,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {12662#true} call #t~ret6 := main(); {12662#true} is VALID [2022-04-27 11:01:18,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {12662#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12662#true} is VALID [2022-04-27 11:01:18,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {12662#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12667#(= main_~i~0 0)} is VALID [2022-04-27 11:01:18,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {12667#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12667#(= main_~i~0 0)} is VALID [2022-04-27 11:01:18,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {12667#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:01:18,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:01:18,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:01:18,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:01:18,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:01:18,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:01:18,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:01:18,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:01:18,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:01:18,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:01:18,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12673#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:01:18,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {12673#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12674#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:01:18,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {12674#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:01:18,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} assume !(~i~0 < ~n~0); {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:01:18,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} ~i~1 := 0; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:01:18,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:01:18,604 INFO L272 TraceCheckUtils]: 24: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:01:18,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,605 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12662#true} {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:01:18,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:01:18,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:18,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:18,606 INFO L272 TraceCheckUtils]: 32: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:01:18,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,607 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12662#true} {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:18,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:01:18,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:18,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:18,608 INFO L272 TraceCheckUtils]: 40: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:01:18,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,620 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12662#true} {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:18,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:18,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:18,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:18,622 INFO L272 TraceCheckUtils]: 48: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:01:18,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,623 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12662#true} {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:18,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:01:18,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:18,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:18,624 INFO L272 TraceCheckUtils]: 56: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:01:18,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,625 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12662#true} {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:18,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:01:18,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:18,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:18,627 INFO L272 TraceCheckUtils]: 64: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:01:18,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:01:18,627 INFO L290 TraceCheckUtils]: 66: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:01:18,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:01:18,628 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12662#true} {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:18,628 INFO L290 TraceCheckUtils]: 69: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:01:18,629 INFO L290 TraceCheckUtils]: 70: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:01:18,629 INFO L290 TraceCheckUtils]: 71: Hoare triple {12706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12707#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:01:18,630 INFO L272 TraceCheckUtils]: 72: Hoare triple {12707#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12708#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:01:18,630 INFO L290 TraceCheckUtils]: 73: Hoare triple {12708#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12709#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:01:18,631 INFO L290 TraceCheckUtils]: 74: Hoare triple {12709#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12663#false} is VALID [2022-04-27 11:01:18,631 INFO L290 TraceCheckUtils]: 75: Hoare triple {12663#false} assume !false; {12663#false} is VALID [2022-04-27 11:01:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:01:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:18,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480227916] [2022-04-27 11:01:18,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480227916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:18,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657509848] [2022-04-27 11:01:18,632 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:01:18,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:18,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:18,636 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:01:18,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 11:01:18,725 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-27 11:01:18,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:01:18,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 11:01:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:18,872 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 11:02:28,260 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 19 treesize of output 7 [2022-04-27 11:02:28,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {12662#true} call ULTIMATE.init(); {12662#true} is VALID [2022-04-27 11:02:28,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#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(9, 2); {12662#true} is VALID [2022-04-27 11:02:28,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:28,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12662#true} #70#return; {12662#true} is VALID [2022-04-27 11:02:28,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {12662#true} call #t~ret6 := main(); {12662#true} is VALID [2022-04-27 11:02:28,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {12662#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12662#true} is VALID [2022-04-27 11:02:28,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {12662#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12667#(= main_~i~0 0)} is VALID [2022-04-27 11:02:28,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {12667#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12667#(= main_~i~0 0)} is VALID [2022-04-27 11:02:28,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {12667#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:02:28,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:02:28,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:02:28,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:02:28,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:02:28,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:02:28,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:02:28,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:02:28,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:02:28,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:02:28,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12673#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:02:28,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {12673#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:02:28,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:02:28,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} assume !(~i~0 < ~n~0); {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:02:28,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} ~i~1 := 0; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,322 INFO L272 TraceCheckUtils]: 24: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} ~cond := #in~cond; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume !(0 == ~cond); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume true; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,324 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {12676#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,326 INFO L272 TraceCheckUtils]: 32: Hoare triple {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} ~cond := #in~cond; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume !(0 == ~cond); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume true; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,327 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {12805#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,329 INFO L272 TraceCheckUtils]: 40: Hoare triple {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} ~cond := #in~cond; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume !(0 == ~cond); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume true; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,330 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {12830#(and (= 1 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,332 INFO L272 TraceCheckUtils]: 48: Hoare triple {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} ~cond := #in~cond; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume !(0 == ~cond); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume true; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,334 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {12855#(and (= (+ (- 2) main_~i~1) 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,336 INFO L272 TraceCheckUtils]: 56: Hoare triple {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} ~cond := #in~cond; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume !(0 == ~cond); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume true; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,337 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {12880#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,339 INFO L272 TraceCheckUtils]: 64: Hoare triple {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} ~cond := #in~cond; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume !(0 == ~cond); {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} assume true; {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} is VALID [2022-04-27 11:02:28,340 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12786#(exists ((v_main_~x~0.base_BEFORE_CALL_72 Int) (v_main_~x~0.offset_BEFORE_CALL_72 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_72) (+ v_main_~x~0.offset_BEFORE_CALL_72 24)) 0))} {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {12905#(and (= 4 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12930#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-27 11:02:28,342 INFO L290 TraceCheckUtils]: 71: Hoare triple {12930#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12707#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:02:28,342 INFO L272 TraceCheckUtils]: 72: Hoare triple {12707#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:02:28,342 INFO L290 TraceCheckUtils]: 73: Hoare triple {12937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:02:28,343 INFO L290 TraceCheckUtils]: 74: Hoare triple {12941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12663#false} is VALID [2022-04-27 11:02:28,343 INFO L290 TraceCheckUtils]: 75: Hoare triple {12663#false} assume !false; {12663#false} is VALID [2022-04-27 11:02:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:02:28,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:02:30,607 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 11:02:30,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 11:02:30,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {12663#false} assume !false; {12663#false} is VALID [2022-04-27 11:02:30,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {12941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12663#false} is VALID [2022-04-27 11:02:30,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {12937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:02:30,730 INFO L272 TraceCheckUtils]: 72: Hoare triple {12707#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:02:30,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {12706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12707#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:02:30,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:30,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:30,732 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12662#true} {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:30,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:02:30,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:02:30,732 INFO L272 TraceCheckUtils]: 64: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:02:30,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:30,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12701#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:30,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:30,734 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12662#true} {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:30,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:02:30,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:02:30,734 INFO L272 TraceCheckUtils]: 56: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:02:30,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:30,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12696#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:30,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:30,736 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12662#true} {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:30,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:02:30,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:02:30,736 INFO L272 TraceCheckUtils]: 48: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:02:30,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:30,737 INFO L290 TraceCheckUtils]: 46: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:30,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:30,748 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12662#true} {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:30,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:02:30,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:02:30,748 INFO L272 TraceCheckUtils]: 40: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:02:30,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:30,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:30,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:30,751 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12662#true} {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:30,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:02:30,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:02:30,751 INFO L272 TraceCheckUtils]: 32: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:02:30,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:30,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:30,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:30,753 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12662#true} {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:30,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {12662#true} assume !(0 == ~cond); {12662#true} is VALID [2022-04-27 11:02:30,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {12662#true} ~cond := #in~cond; {12662#true} is VALID [2022-04-27 11:02:30,753 INFO L272 TraceCheckUtils]: 24: Hoare triple {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12662#true} is VALID [2022-04-27 11:02:30,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:30,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} ~i~1 := 0; {13083#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:30,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} assume !(~i~0 < ~n~0); {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:02:30,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:02:30,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {12673#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12675#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-27 11:02:30,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12673#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:02:30,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:02:30,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12672#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:02:30,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:02:30,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12671#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:02:30,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:02:30,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12670#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:02:30,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:02:30,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12669#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:02:30,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:02:30,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {12667#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12668#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:02:30,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {12667#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12667#(= main_~i~0 0)} is VALID [2022-04-27 11:02:30,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {12662#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12667#(= main_~i~0 0)} is VALID [2022-04-27 11:02:30,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {12662#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12662#true} is VALID [2022-04-27 11:02:30,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {12662#true} call #t~ret6 := main(); {12662#true} is VALID [2022-04-27 11:02:30,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#true} {12662#true} #70#return; {12662#true} is VALID [2022-04-27 11:02:30,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#true} assume true; {12662#true} is VALID [2022-04-27 11:02:30,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {12662#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(9, 2); {12662#true} is VALID [2022-04-27 11:02:30,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {12662#true} call ULTIMATE.init(); {12662#true} is VALID [2022-04-27 11:02:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 11:02:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657509848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:02:30,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:02:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 32 [2022-04-27 11:02:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234101784] [2022-04-27 11:02:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:02:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 76 [2022-04-27 11:02:30,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:02:30,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:02:30,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:30,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:02:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:02:30,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:02:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=897, Unknown=7, NotChecked=0, Total=992 [2022-04-27 11:02:30,847 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:02:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:32,803 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2022-04-27 11:02:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 11:02:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 76 [2022-04-27 11:02:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:02:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:02:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 78 transitions. [2022-04-27 11:02:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:02:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 78 transitions. [2022-04-27 11:02:32,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 78 transitions. [2022-04-27 11:02:32,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:32,874 INFO L225 Difference]: With dead ends: 128 [2022-04-27 11:02:32,874 INFO L226 Difference]: Without dead ends: 126 [2022-04-27 11:02:32,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 141 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=223, Invalid=2422, Unknown=7, NotChecked=0, Total=2652 [2022-04-27 11:02:32,875 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 65 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:02:32,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 260 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1046 Invalid, 0 Unknown, 74 Unchecked, 0.8s Time] [2022-04-27 11:02:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-27 11:02:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-04-27 11:02:32,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:02:32,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 124 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:02:32,928 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 124 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:02:32,928 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 124 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:02:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:32,930 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-27 11:02:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-27 11:02:32,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:32,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:32,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 126 states. [2022-04-27 11:02:32,931 INFO L87 Difference]: Start difference. First operand has 124 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 126 states. [2022-04-27 11:02:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:32,933 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-27 11:02:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-27 11:02:32,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:32,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:32,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:02:32,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:02:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:02:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2022-04-27 11:02:32,936 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 76 [2022-04-27 11:02:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:02:32,937 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2022-04-27 11:02:32,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:02:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2022-04-27 11:02:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 11:02:32,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:02:32,938 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:02:32,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 11:02:33,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:33,162 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:02:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:02:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 18 times [2022-04-27 11:02:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:02:33,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270409625] [2022-04-27 11:02:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:02:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:02:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:02:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {13873#(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(9, 2); {13823#true} is VALID [2022-04-27 11:02:33,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13823#true} {13823#true} #70#return; {13823#true} is VALID [2022-04-27 11:02:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 11:02:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-27 11:02:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 11:02:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13842#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-27 11:02:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13847#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 11:02:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13852#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-27 11:02:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13857#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-27 11:02:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13862#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-27 11:02:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13867#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:33,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {13823#true} call ULTIMATE.init(); {13873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:02:33,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {13873#(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(9, 2); {13823#true} is VALID [2022-04-27 11:02:33,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13823#true} #70#return; {13823#true} is VALID [2022-04-27 11:02:33,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {13823#true} call #t~ret6 := main(); {13823#true} is VALID [2022-04-27 11:02:33,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {13823#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13823#true} is VALID [2022-04-27 11:02:33,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {13823#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13828#(= main_~i~0 0)} is VALID [2022-04-27 11:02:33,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {13828#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13828#(= main_~i~0 0)} is VALID [2022-04-27 11:02:33,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {13828#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13829#(<= main_~i~0 1)} is VALID [2022-04-27 11:02:33,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {13829#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13829#(<= main_~i~0 1)} is VALID [2022-04-27 11:02:33,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {13829#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13830#(<= main_~i~0 2)} is VALID [2022-04-27 11:02:33,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {13830#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13830#(<= main_~i~0 2)} is VALID [2022-04-27 11:02:33,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {13830#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13831#(<= main_~i~0 3)} is VALID [2022-04-27 11:02:33,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13831#(<= main_~i~0 3)} is VALID [2022-04-27 11:02:33,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13832#(<= main_~i~0 4)} is VALID [2022-04-27 11:02:33,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {13832#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13832#(<= main_~i~0 4)} is VALID [2022-04-27 11:02:33,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {13832#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13833#(<= main_~i~0 5)} is VALID [2022-04-27 11:02:33,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {13833#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13833#(<= main_~i~0 5)} is VALID [2022-04-27 11:02:33,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {13833#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13834#(<= main_~i~0 6)} is VALID [2022-04-27 11:02:33,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {13834#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13834#(<= main_~i~0 6)} is VALID [2022-04-27 11:02:33,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {13834#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13835#(<= main_~i~0 7)} is VALID [2022-04-27 11:02:33,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {13835#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {13836#(<= main_~n~0 7)} is VALID [2022-04-27 11:02:33,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {13836#(<= main_~n~0 7)} ~i~1 := 0; {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-27 11:02:33,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-27 11:02:33,431 INFO L272 TraceCheckUtils]: 24: Hoare triple {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,432 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13823#true} {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-27 11:02:33,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} havoc #t~mem5; {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-27 11:02:33,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {13837#(and (<= main_~n~0 7) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:33,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:33,433 INFO L272 TraceCheckUtils]: 32: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,434 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13823#true} {13842#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:33,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:33,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:33,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:33,435 INFO L272 TraceCheckUtils]: 40: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,436 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13823#true} {13847#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:33,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:33,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:33,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:33,438 INFO L272 TraceCheckUtils]: 48: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,438 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13823#true} {13852#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:33,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:33,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:33,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:33,440 INFO L272 TraceCheckUtils]: 56: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,440 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13823#true} {13857#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:33,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:33,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:33,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:33,442 INFO L272 TraceCheckUtils]: 64: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,443 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13823#true} {13862#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:33,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:33,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:33,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:33,444 INFO L272 TraceCheckUtils]: 72: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:33,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:33,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:33,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:33,444 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13823#true} {13867#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:33,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:33,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13872#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 11:02:33,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {13872#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13824#false} is VALID [2022-04-27 11:02:33,446 INFO L272 TraceCheckUtils]: 80: Hoare triple {13824#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13824#false} is VALID [2022-04-27 11:02:33,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {13824#false} ~cond := #in~cond; {13824#false} is VALID [2022-04-27 11:02:33,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {13824#false} assume 0 == ~cond; {13824#false} is VALID [2022-04-27 11:02:33,446 INFO L290 TraceCheckUtils]: 83: Hoare triple {13824#false} assume !false; {13824#false} is VALID [2022-04-27 11:02:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 87 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:02:33,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:02:33,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270409625] [2022-04-27 11:02:33,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270409625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:02:33,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064728590] [2022-04-27 11:02:33,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:02:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:02:33,448 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:02:33,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 11:02:33,571 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-27 11:02:33,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:02:33,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:02:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:33,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:02:34,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {13823#true} call ULTIMATE.init(); {13823#true} is VALID [2022-04-27 11:02:34,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#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(9, 2); {13823#true} is VALID [2022-04-27 11:02:34,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13823#true} #70#return; {13823#true} is VALID [2022-04-27 11:02:34,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {13823#true} call #t~ret6 := main(); {13823#true} is VALID [2022-04-27 11:02:34,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {13823#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13823#true} is VALID [2022-04-27 11:02:34,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {13823#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13895#(<= main_~i~0 0)} is VALID [2022-04-27 11:02:34,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {13895#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13895#(<= main_~i~0 0)} is VALID [2022-04-27 11:02:34,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {13895#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13829#(<= main_~i~0 1)} is VALID [2022-04-27 11:02:34,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {13829#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13829#(<= main_~i~0 1)} is VALID [2022-04-27 11:02:34,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {13829#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13830#(<= main_~i~0 2)} is VALID [2022-04-27 11:02:34,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {13830#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13830#(<= main_~i~0 2)} is VALID [2022-04-27 11:02:34,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {13830#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13831#(<= main_~i~0 3)} is VALID [2022-04-27 11:02:34,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13831#(<= main_~i~0 3)} is VALID [2022-04-27 11:02:34,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13832#(<= main_~i~0 4)} is VALID [2022-04-27 11:02:34,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {13832#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13832#(<= main_~i~0 4)} is VALID [2022-04-27 11:02:34,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {13832#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13833#(<= main_~i~0 5)} is VALID [2022-04-27 11:02:34,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {13833#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13833#(<= main_~i~0 5)} is VALID [2022-04-27 11:02:34,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {13833#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13834#(<= main_~i~0 6)} is VALID [2022-04-27 11:02:34,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {13834#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13834#(<= main_~i~0 6)} is VALID [2022-04-27 11:02:34,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {13834#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13835#(<= main_~i~0 7)} is VALID [2022-04-27 11:02:34,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {13835#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {13836#(<= main_~n~0 7)} is VALID [2022-04-27 11:02:34,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {13836#(<= main_~n~0 7)} ~i~1 := 0; {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,304 INFO L272 TraceCheckUtils]: 24: Hoare triple {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,305 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13823#true} {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #68#return; {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {13944#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,306 INFO L272 TraceCheckUtils]: 32: Hoare triple {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,307 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13823#true} {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #68#return; {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {13969#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-27 11:02:34,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-27 11:02:34,308 INFO L272 TraceCheckUtils]: 40: Hoare triple {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,309 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13823#true} {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #68#return; {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-27 11:02:34,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} havoc #t~mem5; {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-27 11:02:34,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {13994#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-27 11:02:34,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-27 11:02:34,310 INFO L272 TraceCheckUtils]: 48: Hoare triple {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,311 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13823#true} {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #68#return; {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-27 11:02:34,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} havoc #t~mem5; {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-27 11:02:34,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {14019#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-27 11:02:34,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-27 11:02:34,312 INFO L272 TraceCheckUtils]: 56: Hoare triple {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,313 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13823#true} {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #68#return; {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-27 11:02:34,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} havoc #t~mem5; {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-27 11:02:34,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {14044#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,314 INFO L272 TraceCheckUtils]: 64: Hoare triple {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,314 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13823#true} {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #68#return; {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {14069#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,316 INFO L272 TraceCheckUtils]: 72: Hoare triple {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,316 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13823#true} {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #68#return; {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {14094#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14119#(and (<= 7 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-27 11:02:34,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {14119#(and (<= 7 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13824#false} is VALID [2022-04-27 11:02:34,318 INFO L272 TraceCheckUtils]: 80: Hoare triple {13824#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13824#false} is VALID [2022-04-27 11:02:34,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {13824#false} ~cond := #in~cond; {13824#false} is VALID [2022-04-27 11:02:34,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {13824#false} assume 0 == ~cond; {13824#false} is VALID [2022-04-27 11:02:34,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {13824#false} assume !false; {13824#false} is VALID [2022-04-27 11:02:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:02:34,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:02:34,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {13824#false} assume !false; {13824#false} is VALID [2022-04-27 11:02:34,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {13824#false} assume 0 == ~cond; {13824#false} is VALID [2022-04-27 11:02:34,697 INFO L290 TraceCheckUtils]: 81: Hoare triple {13824#false} ~cond := #in~cond; {13824#false} is VALID [2022-04-27 11:02:34,697 INFO L272 TraceCheckUtils]: 80: Hoare triple {13824#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13824#false} is VALID [2022-04-27 11:02:34,697 INFO L290 TraceCheckUtils]: 79: Hoare triple {13872#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13824#false} is VALID [2022-04-27 11:02:34,698 INFO L290 TraceCheckUtils]: 78: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13872#(<= main_~n~0 main_~i~1)} is VALID [2022-04-27 11:02:34,698 INFO L290 TraceCheckUtils]: 77: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:34,699 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13823#true} {13867#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:34,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,699 INFO L290 TraceCheckUtils]: 74: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,699 INFO L272 TraceCheckUtils]: 72: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,699 INFO L290 TraceCheckUtils]: 71: Hoare triple {13867#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:34,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13867#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-27 11:02:34,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:34,700 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13823#true} {13862#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:34,701 INFO L290 TraceCheckUtils]: 67: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,701 INFO L272 TraceCheckUtils]: 64: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {13862#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:34,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13862#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-27 11:02:34,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:34,702 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13823#true} {13857#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:34,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,702 INFO L272 TraceCheckUtils]: 56: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {13857#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:34,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13857#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-27 11:02:34,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:34,710 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13823#true} {13852#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:34,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,710 INFO L272 TraceCheckUtils]: 48: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {13852#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:34,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13852#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-27 11:02:34,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:34,712 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13823#true} {13847#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:34,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,712 INFO L272 TraceCheckUtils]: 40: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {13847#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:34,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13847#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-27 11:02:34,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:34,714 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13823#true} {13842#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:34,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,714 INFO L272 TraceCheckUtils]: 32: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {13842#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:34,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {14294#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13842#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-27 11:02:34,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {14294#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {14294#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-27 11:02:34,715 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13823#true} {14294#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {14294#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-27 11:02:34,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {13823#true} assume !(0 == ~cond); {13823#true} is VALID [2022-04-27 11:02:34,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {13823#true} ~cond := #in~cond; {13823#true} is VALID [2022-04-27 11:02:34,715 INFO L272 TraceCheckUtils]: 24: Hoare triple {14294#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13823#true} is VALID [2022-04-27 11:02:34,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {14294#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14294#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-27 11:02:34,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {13836#(<= main_~n~0 7)} ~i~1 := 0; {14294#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-27 11:02:34,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {13835#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {13836#(<= main_~n~0 7)} is VALID [2022-04-27 11:02:34,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {13834#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13835#(<= main_~i~0 7)} is VALID [2022-04-27 11:02:34,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {13834#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13834#(<= main_~i~0 6)} is VALID [2022-04-27 11:02:34,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {13833#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13834#(<= main_~i~0 6)} is VALID [2022-04-27 11:02:34,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {13833#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13833#(<= main_~i~0 5)} is VALID [2022-04-27 11:02:34,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {13832#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13833#(<= main_~i~0 5)} is VALID [2022-04-27 11:02:34,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {13832#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13832#(<= main_~i~0 4)} is VALID [2022-04-27 11:02:34,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13832#(<= main_~i~0 4)} is VALID [2022-04-27 11:02:34,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13831#(<= main_~i~0 3)} is VALID [2022-04-27 11:02:34,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {13830#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13831#(<= main_~i~0 3)} is VALID [2022-04-27 11:02:34,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {13830#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13830#(<= main_~i~0 2)} is VALID [2022-04-27 11:02:34,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {13829#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13830#(<= main_~i~0 2)} is VALID [2022-04-27 11:02:34,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {13829#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13829#(<= main_~i~0 1)} is VALID [2022-04-27 11:02:34,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {13895#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13829#(<= main_~i~0 1)} is VALID [2022-04-27 11:02:34,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {13895#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13895#(<= main_~i~0 0)} is VALID [2022-04-27 11:02:34,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {13823#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13895#(<= main_~i~0 0)} is VALID [2022-04-27 11:02:34,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {13823#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13823#true} is VALID [2022-04-27 11:02:34,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {13823#true} call #t~ret6 := main(); {13823#true} is VALID [2022-04-27 11:02:34,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13823#true} {13823#true} #70#return; {13823#true} is VALID [2022-04-27 11:02:34,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {13823#true} assume true; {13823#true} is VALID [2022-04-27 11:02:34,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {13823#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(9, 2); {13823#true} is VALID [2022-04-27 11:02:34,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {13823#true} call ULTIMATE.init(); {13823#true} is VALID [2022-04-27 11:02:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:02:34,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064728590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:02:34,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:02:34,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-27 11:02:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870806286] [2022-04-27 11:02:34,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:02:34,723 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 84 [2022-04-27 11:02:34,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:02:34,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:02:34,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:34,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:02:34,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:02:34,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:02:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:02:34,800 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:02:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:35,610 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2022-04-27 11:02:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 11:02:35,610 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 84 [2022-04-27 11:02:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:02:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:02:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-27 11:02:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:02:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-27 11:02:35,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-27 11:02:35,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:35,704 INFO L225 Difference]: With dead ends: 146 [2022-04-27 11:02:35,704 INFO L226 Difference]: Without dead ends: 90 [2022-04-27 11:02:35,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1721, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 11:02:35,705 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:02:35,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 49 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:02:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-27 11:02:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-27 11:02:35,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:02:35,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:02:35,750 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:02:35,750 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:02:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:35,752 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-27 11:02:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-27 11:02:35,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:35,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:35,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-27 11:02:35,752 INFO L87 Difference]: Start difference. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-27 11:02:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:35,754 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-27 11:02:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-27 11:02:35,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:35,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:35,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:02:35,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:02:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:02:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-27 11:02:35,757 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2022-04-27 11:02:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:02:35,757 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-27 11:02:35,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 17 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:02:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-27 11:02:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 11:02:35,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:02:35,759 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:02:35,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:02:35,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:35,984 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:02:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:02:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 19 times [2022-04-27 11:02:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:02:35,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244944887] [2022-04-27 11:02:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:02:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:02:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:02:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {14986#(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(9, 2); {14932#true} is VALID [2022-04-27 11:02:36,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14932#true} {14932#true} #70#return; {14932#true} is VALID [2022-04-27 11:02:36,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 11:02:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:02:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-27 11:02:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 11:02:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-27 11:02:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-27 11:02:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-27 11:02:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:36,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-27 11:02:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:36,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {14932#true} call ULTIMATE.init(); {14986#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:02:36,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {14986#(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(9, 2); {14932#true} is VALID [2022-04-27 11:02:36,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14932#true} #70#return; {14932#true} is VALID [2022-04-27 11:02:36,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {14932#true} call #t~ret6 := main(); {14932#true} is VALID [2022-04-27 11:02:36,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {14932#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14932#true} is VALID [2022-04-27 11:02:36,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {14932#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {14937#(= main_~i~0 0)} is VALID [2022-04-27 11:02:36,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {14937#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14937#(= main_~i~0 0)} is VALID [2022-04-27 11:02:36,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {14937#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:02:36,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:02:36,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:02:36,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:02:36,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:02:36,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:02:36,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:02:36,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:02:36,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:02:36,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:02:36,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:02:36,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:02:36,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14944#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:02:36,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {14944#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14945#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-27 11:02:36,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {14945#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:02:36,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:02:36,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:02:36,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:02:36,430 INFO L272 TraceCheckUtils]: 26: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,431 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {14932#true} {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:02:36,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:02:36,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:36,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:36,433 INFO L272 TraceCheckUtils]: 34: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,434 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14932#true} {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:36,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:02:36,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:36,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:36,435 INFO L272 TraceCheckUtils]: 42: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,436 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14932#true} {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:36,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:02:36,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:36,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:36,437 INFO L272 TraceCheckUtils]: 50: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,438 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14932#true} {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:36,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:36,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:36,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:36,440 INFO L272 TraceCheckUtils]: 58: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,441 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {14932#true} {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:36,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:02:36,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:36,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:36,442 INFO L272 TraceCheckUtils]: 66: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,442 INFO L290 TraceCheckUtils]: 69: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,443 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14932#true} {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:36,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:02:36,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:36,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:36,445 INFO L272 TraceCheckUtils]: 74: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:02:36,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:02:36,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:02:36,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:02:36,445 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14932#true} {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:36,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:02:36,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14982#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:02:36,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {14982#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14983#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:02:36,447 INFO L272 TraceCheckUtils]: 82: Hoare triple {14983#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14984#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:02:36,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {14984#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14985#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:02:36,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {14985#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14933#false} is VALID [2022-04-27 11:02:36,448 INFO L290 TraceCheckUtils]: 85: Hoare triple {14933#false} assume !false; {14933#false} is VALID [2022-04-27 11:02:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:02:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:02:36,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244944887] [2022-04-27 11:02:36,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244944887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:02:36,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529866668] [2022-04-27 11:02:36,449 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:02:36,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:36,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:02:36,450 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:02:36,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 11:02:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 11:02:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:36,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:02:36,707 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 11:04:12,024 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 19 treesize of output 7 [2022-04-27 11:04:12,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {14932#true} call ULTIMATE.init(); {14932#true} is VALID [2022-04-27 11:04:12,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#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(9, 2); {14932#true} is VALID [2022-04-27 11:04:12,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:12,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14932#true} #70#return; {14932#true} is VALID [2022-04-27 11:04:12,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {14932#true} call #t~ret6 := main(); {14932#true} is VALID [2022-04-27 11:04:12,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {14932#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14932#true} is VALID [2022-04-27 11:04:12,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {14932#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {14937#(= main_~i~0 0)} is VALID [2022-04-27 11:04:12,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {14937#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14937#(= main_~i~0 0)} is VALID [2022-04-27 11:04:12,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {14937#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:04:12,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:04:12,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:04:12,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:04:12,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:04:12,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:04:12,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:04:12,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:04:12,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:04:12,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:04:12,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:04:12,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:04:12,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14944#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:04:12,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {14944#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:12,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:12,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:12,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:12,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:12,090 INFO L272 TraceCheckUtils]: 26: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,091 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:12,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:12,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,093 INFO L272 TraceCheckUtils]: 34: Hoare triple {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,094 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {15087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:04:12,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:04:12,096 INFO L272 TraceCheckUtils]: 42: Hoare triple {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,098 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} #68#return; {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:04:12,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} havoc #t~mem5; {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:04:12,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {15112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,100 INFO L272 TraceCheckUtils]: 50: Hoare triple {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,101 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} #68#return; {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} havoc #t~mem5; {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {15137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:04:12,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:04:12,103 INFO L272 TraceCheckUtils]: 58: Hoare triple {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,116 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} #68#return; {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:04:12,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} havoc #t~mem5; {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} is VALID [2022-04-27 11:04:12,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {15162#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:04:12,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:04:12,119 INFO L272 TraceCheckUtils]: 66: Hoare triple {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,120 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} #68#return; {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:04:12,121 INFO L290 TraceCheckUtils]: 71: Hoare triple {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} havoc #t~mem5; {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:04:12,121 INFO L290 TraceCheckUtils]: 72: Hoare triple {15187#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,123 INFO L272 TraceCheckUtils]: 74: Hoare triple {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,123 INFO L290 TraceCheckUtils]: 75: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} ~cond := #in~cond; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume !(0 == ~cond); {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} assume true; {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} is VALID [2022-04-27 11:04:12,125 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15068#(exists ((v_main_~x~0.base_BEFORE_CALL_84 Int) (v_main_~x~0.offset_BEFORE_CALL_84 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_84) (+ 28 v_main_~x~0.offset_BEFORE_CALL_84)) 0))} {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} #68#return; {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,125 INFO L290 TraceCheckUtils]: 79: Hoare triple {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} havoc #t~mem5; {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:04:12,126 INFO L290 TraceCheckUtils]: 80: Hoare triple {15212#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15237#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 5))} is VALID [2022-04-27 11:04:12,126 INFO L290 TraceCheckUtils]: 81: Hoare triple {15237#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14983#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:04:12,127 INFO L272 TraceCheckUtils]: 82: Hoare triple {14983#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:12,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {15244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:12,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {15248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14933#false} is VALID [2022-04-27 11:04:12,128 INFO L290 TraceCheckUtils]: 85: Hoare triple {14933#false} assume !false; {14933#false} is VALID [2022-04-27 11:04:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:04:12,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:04:14,435 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 11:04:14,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 11:04:14,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {14933#false} assume !false; {14933#false} is VALID [2022-04-27 11:04:14,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {15248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14933#false} is VALID [2022-04-27 11:04:14,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {15244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:14,562 INFO L272 TraceCheckUtils]: 82: Hoare triple {14983#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:14,563 INFO L290 TraceCheckUtils]: 81: Hoare triple {14982#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14983#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:04:14,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14982#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:14,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:14,565 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14932#true} {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:14,565 INFO L290 TraceCheckUtils]: 77: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,565 INFO L290 TraceCheckUtils]: 76: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,565 INFO L290 TraceCheckUtils]: 75: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,565 INFO L272 TraceCheckUtils]: 74: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:14,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14977#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:14,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:14,568 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14932#true} {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:14,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,568 INFO L272 TraceCheckUtils]: 66: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:14,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14972#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:14,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:14,570 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {14932#true} {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:14,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,571 INFO L272 TraceCheckUtils]: 58: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:14,572 INFO L290 TraceCheckUtils]: 56: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14967#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:14,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:14,573 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14932#true} {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:14,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,574 INFO L272 TraceCheckUtils]: 50: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:14,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14962#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:14,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:14,576 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14932#true} {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:14,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,577 INFO L272 TraceCheckUtils]: 42: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:14,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14957#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:14,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:14,579 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14932#true} {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:14,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,579 INFO L272 TraceCheckUtils]: 34: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:14,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14952#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:14,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:04:14,581 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {14932#true} {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:04:14,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {14932#true} assume !(0 == ~cond); {14932#true} is VALID [2022-04-27 11:04:14,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {14932#true} ~cond := #in~cond; {14932#true} is VALID [2022-04-27 11:04:14,581 INFO L272 TraceCheckUtils]: 26: Hoare triple {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {14932#true} is VALID [2022-04-27 11:04:14,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:04:14,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {15414#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:04:14,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:14,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:14,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {14944#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14946#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:14,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14944#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:04:14,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:04:14,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14943#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:04:14,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:04:14,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14942#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:04:14,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:04:14,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14941#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:04:14,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:04:14,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14940#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:04:14,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:04:14,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14939#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:04:14,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:04:14,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {14937#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14938#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:04:14,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {14937#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {14937#(= main_~i~0 0)} is VALID [2022-04-27 11:04:14,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {14932#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {14937#(= main_~i~0 0)} is VALID [2022-04-27 11:04:14,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {14932#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14932#true} is VALID [2022-04-27 11:04:14,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {14932#true} call #t~ret6 := main(); {14932#true} is VALID [2022-04-27 11:04:14,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14932#true} {14932#true} #70#return; {14932#true} is VALID [2022-04-27 11:04:14,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {14932#true} assume true; {14932#true} is VALID [2022-04-27 11:04:14,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#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(9, 2); {14932#true} is VALID [2022-04-27 11:04:14,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {14932#true} call ULTIMATE.init(); {14932#true} is VALID [2022-04-27 11:04:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:04:14,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529866668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:04:14,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:04:14,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 35 [2022-04-27 11:04:14,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947714009] [2022-04-27 11:04:14,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:04:14,590 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 86 [2022-04-27 11:04:14,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:14,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:04:14,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:14,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 11:04:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 11:04:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1085, Unknown=8, NotChecked=0, Total=1190 [2022-04-27 11:04:14,674 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:04:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:16,912 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2022-04-27 11:04:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 11:04:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 86 [2022-04-27 11:04:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:04:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 88 transitions. [2022-04-27 11:04:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:04:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 88 transitions. [2022-04-27 11:04:16,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 88 transitions. [2022-04-27 11:04:17,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:17,008 INFO L225 Difference]: With dead ends: 158 [2022-04-27 11:04:17,008 INFO L226 Difference]: Without dead ends: 156 [2022-04-27 11:04:17,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 97.2s TimeCoverageRelationStatistics Valid=250, Invalid=3048, Unknown=8, NotChecked=0, Total=3306 [2022-04-27 11:04:17,009 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 71 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:17,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 281 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1152 Invalid, 0 Unknown, 119 Unchecked, 0.9s Time] [2022-04-27 11:04:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-27 11:04:17,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 100. [2022-04-27 11:04:17,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:17,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 100 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:04:17,057 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 100 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:04:17,058 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 100 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:04:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:17,060 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-04-27 11:04:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2022-04-27 11:04:17,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:17,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:17,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 156 states. [2022-04-27 11:04:17,061 INFO L87 Difference]: Start difference. First operand has 100 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 156 states. [2022-04-27 11:04:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:17,064 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-04-27 11:04:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2022-04-27 11:04:17,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:17,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:17,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:17,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:04:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-27 11:04:17,066 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 86 [2022-04-27 11:04:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:17,066 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-27 11:04:17,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.411764705882353) internal successors, (82), 32 states have internal predecessors, (82), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:04:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 11:04:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 11:04:17,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:17,067 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:17,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 11:04:17,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-27 11:04:17,283 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1255988178, now seen corresponding path program 20 times [2022-04-27 11:04:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973767573] [2022-04-27 11:04:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {16295#(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(9, 2); {16240#true} is VALID [2022-04-27 11:04:17,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16240#true} {16240#true} #70#return; {16240#true} is VALID [2022-04-27 11:04:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 11:04:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-27 11:04:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-27 11:04:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-27 11:04:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:17,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 11:04:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-27 11:04:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 11:04:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:17,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {16240#true} call ULTIMATE.init(); {16295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:17,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {16295#(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(9, 2); {16240#true} is VALID [2022-04-27 11:04:17,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16240#true} #70#return; {16240#true} is VALID [2022-04-27 11:04:17,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {16240#true} call #t~ret6 := main(); {16240#true} is VALID [2022-04-27 11:04:17,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {16240#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16240#true} is VALID [2022-04-27 11:04:17,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {16240#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16245#(= main_~i~0 0)} is VALID [2022-04-27 11:04:17,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {16245#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16245#(= main_~i~0 0)} is VALID [2022-04-27 11:04:17,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {16245#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:04:17,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:04:17,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:04:17,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:04:17,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:04:17,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:04:17,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:04:17,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:04:17,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:04:17,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:04:17,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:04:17,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:04:17,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:04:17,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {16252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16253#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-27 11:04:17,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {16253#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16254#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} is VALID [2022-04-27 11:04:17,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {16254#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:17,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:17,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:04:17,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:17,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:17,741 INFO L272 TraceCheckUtils]: 28: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,742 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16240#true} {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:17,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:04:17,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:17,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:17,744 INFO L272 TraceCheckUtils]: 36: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,744 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16240#true} {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:17,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:04:17,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:17,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:17,746 INFO L272 TraceCheckUtils]: 44: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,747 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16240#true} {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:17,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:04:17,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:17,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:17,748 INFO L272 TraceCheckUtils]: 52: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,749 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16240#true} {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:17,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:17,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:17,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:17,751 INFO L272 TraceCheckUtils]: 60: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,752 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16240#true} {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:17,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:04:17,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:17,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:17,753 INFO L272 TraceCheckUtils]: 68: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,754 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16240#true} {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:17,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:04:17,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:17,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:17,756 INFO L272 TraceCheckUtils]: 76: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:04:17,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:04:17,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:04:17,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:04:17,756 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16240#true} {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:17,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:04:17,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16291#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:04:17,758 INFO L290 TraceCheckUtils]: 83: Hoare triple {16291#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16292#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:04:17,758 INFO L272 TraceCheckUtils]: 84: Hoare triple {16292#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:04:17,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {16293#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:04:17,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {16294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16241#false} is VALID [2022-04-27 11:04:17,759 INFO L290 TraceCheckUtils]: 87: Hoare triple {16241#false} assume !false; {16241#false} is VALID [2022-04-27 11:04:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 14 proven. 179 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:04:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973767573] [2022-04-27 11:04:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973767573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923621510] [2022-04-27 11:04:17,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:04:17,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:17,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:17,761 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:17,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 11:04:17,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:04:17,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:04:17,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 11:04:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:17,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:18,006 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 11:04:18,230 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-04-27 11:04:18,230 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 27 treesize of output 26 [2022-04-27 11:05:57,784 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 19 treesize of output 7 [2022-04-27 11:05:57,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {16240#true} call ULTIMATE.init(); {16240#true} is VALID [2022-04-27 11:05:57,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#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(9, 2); {16240#true} is VALID [2022-04-27 11:05:57,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:05:57,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16240#true} #70#return; {16240#true} is VALID [2022-04-27 11:05:57,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {16240#true} call #t~ret6 := main(); {16240#true} is VALID [2022-04-27 11:05:57,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {16240#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16240#true} is VALID [2022-04-27 11:05:57,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {16240#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16245#(= main_~i~0 0)} is VALID [2022-04-27 11:05:57,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {16245#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16245#(= main_~i~0 0)} is VALID [2022-04-27 11:05:57,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {16245#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:05:57,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:05:57,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:05:57,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:05:57,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:05:57,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:05:57,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:05:57,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:05:57,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:05:57,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:05:57,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:05:57,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:05:57,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:05:57,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {16252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16253#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-27 11:05:57,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {16253#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16365#(exists ((v_main_~i~0_205 Int)) (and (<= v_main_~i~0_205 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_205))) 0) (<= (+ v_main_~i~0_205 1) main_~i~0) (<= 7 v_main_~i~0_205)))} is VALID [2022-04-27 11:05:57,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {16365#(exists ((v_main_~i~0_205 Int)) (and (<= v_main_~i~0_205 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_205))) 0) (<= (+ v_main_~i~0_205 1) main_~i~0) (<= 7 v_main_~i~0_205)))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:05:57,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:05:57,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:05:57,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:05:57,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:05:57,855 INFO L272 TraceCheckUtils]: 28: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,857 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:05:57,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:05:57,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {16256#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:05:57,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:05:57,859 INFO L272 TraceCheckUtils]: 36: Hoare triple {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,860 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} #68#return; {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:05:57,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} havoc #t~mem5; {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:05:57,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {16403#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,862 INFO L272 TraceCheckUtils]: 44: Hoare triple {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,863 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} #68#return; {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} havoc #t~mem5; {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {16428#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 1 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} is VALID [2022-04-27 11:05:57,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} is VALID [2022-04-27 11:05:57,865 INFO L272 TraceCheckUtils]: 52: Hoare triple {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,867 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} #68#return; {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} is VALID [2022-04-27 11:05:57,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} havoc #t~mem5; {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} is VALID [2022-04-27 11:05:57,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {16453#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,869 INFO L272 TraceCheckUtils]: 60: Hoare triple {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,870 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} #68#return; {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} havoc #t~mem5; {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,871 INFO L290 TraceCheckUtils]: 66: Hoare triple {16478#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 3 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:05:57,871 INFO L290 TraceCheckUtils]: 67: Hoare triple {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:05:57,872 INFO L272 TraceCheckUtils]: 68: Hoare triple {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,873 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} #68#return; {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:05:57,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} havoc #t~mem5; {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} is VALID [2022-04-27 11:05:57,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {16503#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,875 INFO L290 TraceCheckUtils]: 75: Hoare triple {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,875 INFO L272 TraceCheckUtils]: 76: Hoare triple {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} ~cond := #in~cond; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,876 INFO L290 TraceCheckUtils]: 78: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume !(0 == ~cond); {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,876 INFO L290 TraceCheckUtils]: 79: Hoare triple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} assume true; {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} is VALID [2022-04-27 11:05:57,877 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16384#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ 28 v_main_~x~0.offset_BEFORE_CALL_98)) 0))} {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} #68#return; {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} havoc #t~mem5; {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:05:57,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {16528#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 5 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16553#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 5))} is VALID [2022-04-27 11:05:57,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {16553#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16292#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:05:57,878 INFO L272 TraceCheckUtils]: 84: Hoare triple {16292#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16560#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:05:57,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {16560#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16564#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:05:57,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {16564#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16241#false} is VALID [2022-04-27 11:05:57,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {16241#false} assume !false; {16241#false} is VALID [2022-04-27 11:05:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:05:57,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:06:00,262 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 11:06:00,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 11:06:00,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {16241#false} assume !false; {16241#false} is VALID [2022-04-27 11:06:00,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {16564#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16241#false} is VALID [2022-04-27 11:06:00,404 INFO L290 TraceCheckUtils]: 85: Hoare triple {16560#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16564#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:06:00,404 INFO L272 TraceCheckUtils]: 84: Hoare triple {16292#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16560#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:06:00,405 INFO L290 TraceCheckUtils]: 83: Hoare triple {16291#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16292#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:06:00,405 INFO L290 TraceCheckUtils]: 82: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16291#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:00,406 INFO L290 TraceCheckUtils]: 81: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:00,406 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16240#true} {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:00,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,407 INFO L272 TraceCheckUtils]: 76: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,407 INFO L290 TraceCheckUtils]: 75: Hoare triple {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:00,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16286#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:00,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:00,408 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16240#true} {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:00,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,409 INFO L272 TraceCheckUtils]: 68: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:00,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16281#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:00,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:00,410 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16240#true} {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:00,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,411 INFO L290 TraceCheckUtils]: 62: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,411 INFO L272 TraceCheckUtils]: 60: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,411 INFO L290 TraceCheckUtils]: 59: Hoare triple {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:00,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16276#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:00,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:00,412 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16240#true} {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:00,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,413 INFO L272 TraceCheckUtils]: 52: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:00,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16271#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:00,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:00,414 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16240#true} {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:00,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,415 INFO L290 TraceCheckUtils]: 46: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,415 INFO L272 TraceCheckUtils]: 44: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:00,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16266#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:00,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:00,416 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16240#true} {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:00,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,417 INFO L272 TraceCheckUtils]: 36: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:00,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16261#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:00,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:06:00,418 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16240#true} {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:06:00,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {16240#true} assume !(0 == ~cond); {16240#true} is VALID [2022-04-27 11:06:00,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {16240#true} ~cond := #in~cond; {16240#true} is VALID [2022-04-27 11:06:00,418 INFO L272 TraceCheckUtils]: 28: Hoare triple {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16240#true} is VALID [2022-04-27 11:06:00,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:06:00,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {16730#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:06:00,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:06:00,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:06:00,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {16254#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16255#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:06:00,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {16767#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (<= main_~i~0 6)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16254#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} is VALID [2022-04-27 11:06:00,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {16252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16767#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (<= main_~i~0 6)))} is VALID [2022-04-27 11:06:00,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:06:00,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:06:00,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:06:00,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:06:00,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:06:00,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:06:00,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:06:00,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:06:00,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:06:00,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:06:00,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:06:00,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:06:00,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {16245#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:06:00,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {16245#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16245#(= main_~i~0 0)} is VALID [2022-04-27 11:06:00,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {16240#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16245#(= main_~i~0 0)} is VALID [2022-04-27 11:06:00,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {16240#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16240#true} is VALID [2022-04-27 11:06:00,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {16240#true} call #t~ret6 := main(); {16240#true} is VALID [2022-04-27 11:06:00,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#true} {16240#true} #70#return; {16240#true} is VALID [2022-04-27 11:06:00,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#true} assume true; {16240#true} is VALID [2022-04-27 11:06:00,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#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(9, 2); {16240#true} is VALID [2022-04-27 11:06:00,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {16240#true} call ULTIMATE.init(); {16240#true} is VALID [2022-04-27 11:06:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 14 proven. 179 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:06:00,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923621510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:06:00,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:06:00,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 38 [2022-04-27 11:06:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51510317] [2022-04-27 11:06:00,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:06:00,429 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 88 [2022-04-27 11:06:00,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:06:00,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:06:00,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:06:00,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:06:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:06:00,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:06:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1286, Unknown=8, NotChecked=0, Total=1406 [2022-04-27 11:06:00,545 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:06:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:06:03,476 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2022-04-27 11:06:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-27 11:06:03,476 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 88 [2022-04-27 11:06:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:06:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:06:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 97 transitions. [2022-04-27 11:06:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:06:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 97 transitions. [2022-04-27 11:06:03,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 97 transitions. [2022-04-27 11:06:03,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:06:03,597 INFO L225 Difference]: With dead ends: 204 [2022-04-27 11:06:03,597 INFO L226 Difference]: Without dead ends: 202 [2022-04-27 11:06:03,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 160 SyntacticMatches, 19 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 101.5s TimeCoverageRelationStatistics Valid=276, Invalid=3498, Unknown=8, NotChecked=0, Total=3782 [2022-04-27 11:06:03,599 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:06:03,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 351 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1539 Invalid, 0 Unknown, 113 Unchecked, 1.2s Time] [2022-04-27 11:06:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-27 11:06:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 171. [2022-04-27 11:06:03,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:06:03,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 171 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 134 states have internal predecessors, (135), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:06:03,686 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 171 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 134 states have internal predecessors, (135), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:06:03,687 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 171 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 134 states have internal predecessors, (135), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:06:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:06:03,691 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-04-27 11:06:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 212 transitions. [2022-04-27 11:06:03,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:06:03,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:06:03,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 134 states have internal predecessors, (135), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) Second operand 202 states. [2022-04-27 11:06:03,692 INFO L87 Difference]: Start difference. First operand has 171 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 134 states have internal predecessors, (135), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) Second operand 202 states. [2022-04-27 11:06:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:06:03,696 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-04-27 11:06:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 212 transitions. [2022-04-27 11:06:03,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:06:03,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:06:03,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:06:03,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:06:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 134 states have internal predecessors, (135), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:06:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 180 transitions. [2022-04-27 11:06:03,704 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 180 transitions. Word has length 88 [2022-04-27 11:06:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:06:03,704 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 180 transitions. [2022-04-27 11:06:03,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:06:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 180 transitions. [2022-04-27 11:06:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-27 11:06:03,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:06:03,706 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:06:03,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 11:06:03,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-27 11:06:03,920 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:06:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:06:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash 142232368, now seen corresponding path program 21 times [2022-04-27 11:06:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:06:03,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754142561] [2022-04-27 11:06:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:06:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:06:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:06:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {17874#(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(9, 2); {17818#true} is VALID [2022-04-27 11:06:04,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17818#true} {17818#true} #70#return; {17818#true} is VALID [2022-04-27 11:06:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 11:06:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:06:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:06:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:06:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-27 11:06:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-27 11:06:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-27 11:06:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-27 11:06:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:04,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {17818#true} call ULTIMATE.init(); {17874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:06:04,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {17874#(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(9, 2); {17818#true} is VALID [2022-04-27 11:06:04,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17818#true} #70#return; {17818#true} is VALID [2022-04-27 11:06:04,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {17818#true} call #t~ret6 := main(); {17818#true} is VALID [2022-04-27 11:06:04,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {17818#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17818#true} is VALID [2022-04-27 11:06:04,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {17818#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {17823#(= main_~i~0 0)} is VALID [2022-04-27 11:06:04,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {17823#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17823#(= main_~i~0 0)} is VALID [2022-04-27 11:06:04,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {17823#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:06:04,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:06:04,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:06:04,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:06:04,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:06:04,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:06:04,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:06:04,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:06:04,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:06:04,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:06:04,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:06:04,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:06:04,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17830#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:06:04,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {17830#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17831#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-27 11:06:04,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {17831#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17832#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (<= 8 main_~i~0))} is VALID [2022-04-27 11:06:04,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {17832#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (<= 8 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17832#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (<= 8 main_~i~0))} is VALID [2022-04-27 11:06:04,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {17832#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (<= 8 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17833#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} is VALID [2022-04-27 11:06:04,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {17833#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:06:04,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:06:04,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:06:04,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:06:04,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:06:04,380 INFO L272 TraceCheckUtils]: 30: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,381 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17818#true} {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:06:04,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:06:04,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:04,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:04,382 INFO L272 TraceCheckUtils]: 38: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,382 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17818#true} {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:04,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:06:04,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:04,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:04,384 INFO L272 TraceCheckUtils]: 46: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,385 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17818#true} {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:04,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:06:04,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:04,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:04,386 INFO L272 TraceCheckUtils]: 54: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,387 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17818#true} {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:04,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:04,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:04,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:04,388 INFO L272 TraceCheckUtils]: 62: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,389 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17818#true} {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:04,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:06:04,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:04,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:04,391 INFO L272 TraceCheckUtils]: 70: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,391 INFO L290 TraceCheckUtils]: 73: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,391 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17818#true} {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:04,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:06:04,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:04,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:04,393 INFO L272 TraceCheckUtils]: 78: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:06:04,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:06:04,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:06:04,393 INFO L290 TraceCheckUtils]: 81: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:06:04,394 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17818#true} {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:04,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:06:04,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17870#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:06:04,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {17870#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17871#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:06:04,396 INFO L272 TraceCheckUtils]: 86: Hoare triple {17871#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17872#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:06:04,396 INFO L290 TraceCheckUtils]: 87: Hoare triple {17872#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17873#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:06:04,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {17873#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17819#false} is VALID [2022-04-27 11:06:04,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {17819#false} assume !false; {17819#false} is VALID [2022-04-27 11:06:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 14 proven. 198 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:06:04,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:06:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754142561] [2022-04-27 11:06:04,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754142561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:06:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472425656] [2022-04-27 11:06:04,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:06:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:06:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:06:04,400 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:06:04,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 11:06:04,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 11:06:04,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:06:04,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:06:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:04,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:06:04,679 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 11:06:04,797 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 11:06:04,797 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 25 treesize of output 24 [2022-04-27 11:06:04,823 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-27 11:06:04,823 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 25 treesize of output 24 [2022-04-27 11:07:41,838 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 19 treesize of output 7 [2022-04-27 11:07:41,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {17818#true} call ULTIMATE.init(); {17818#true} is VALID [2022-04-27 11:07:41,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#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(9, 2); {17818#true} is VALID [2022-04-27 11:07:41,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:41,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17818#true} #70#return; {17818#true} is VALID [2022-04-27 11:07:41,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {17818#true} call #t~ret6 := main(); {17818#true} is VALID [2022-04-27 11:07:41,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {17818#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17818#true} is VALID [2022-04-27 11:07:41,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {17818#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {17823#(= main_~i~0 0)} is VALID [2022-04-27 11:07:41,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {17823#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17823#(= main_~i~0 0)} is VALID [2022-04-27 11:07:41,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {17823#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:07:41,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:07:41,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:07:41,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:07:41,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:07:41,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:07:41,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:07:41,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:07:41,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:07:41,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:07:41,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:07:41,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:07:41,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17830#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:07:41,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {17830#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17831#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-27 11:07:41,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {17831#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17832#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (<= 8 main_~i~0))} is VALID [2022-04-27 11:07:41,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {17832#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (<= 8 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:41,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:41,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:41,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:41,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:41,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:07:41,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:07:41,920 INFO L272 TraceCheckUtils]: 30: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,922 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:07:41,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-27 11:07:41,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {17835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:07:41,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:07:41,924 INFO L272 TraceCheckUtils]: 38: Hoare triple {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,926 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} #68#return; {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:07:41,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} havoc #t~mem5; {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} is VALID [2022-04-27 11:07:41,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {17987#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:07:41,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:07:41,928 INFO L272 TraceCheckUtils]: 46: Hoare triple {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,930 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} #68#return; {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:07:41,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} havoc #t~mem5; {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} is VALID [2022-04-27 11:07:41,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {18012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:07:41,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:07:41,932 INFO L272 TraceCheckUtils]: 54: Hoare triple {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,932 INFO L290 TraceCheckUtils]: 55: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,934 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} #68#return; {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:07:41,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} havoc #t~mem5; {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} is VALID [2022-04-27 11:07:41,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {18037#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 2 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} is VALID [2022-04-27 11:07:41,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} is VALID [2022-04-27 11:07:41,937 INFO L272 TraceCheckUtils]: 62: Hoare triple {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,938 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} #68#return; {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} is VALID [2022-04-27 11:07:41,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} havoc #t~mem5; {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} is VALID [2022-04-27 11:07:41,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {18062#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ (- 2) main_~i~1) 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} is VALID [2022-04-27 11:07:41,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} is VALID [2022-04-27 11:07:41,941 INFO L272 TraceCheckUtils]: 70: Hoare triple {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,942 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} #68#return; {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} is VALID [2022-04-27 11:07:41,943 INFO L290 TraceCheckUtils]: 75: Hoare triple {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} havoc #t~mem5; {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} is VALID [2022-04-27 11:07:41,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {18087#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= (+ main_~i~1 (- 3)) 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} is VALID [2022-04-27 11:07:41,944 INFO L290 TraceCheckUtils]: 77: Hoare triple {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} is VALID [2022-04-27 11:07:41,945 INFO L272 TraceCheckUtils]: 78: Hoare triple {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,945 INFO L290 TraceCheckUtils]: 79: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} ~cond := #in~cond; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,945 INFO L290 TraceCheckUtils]: 80: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume !(0 == ~cond); {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,946 INFO L290 TraceCheckUtils]: 81: Hoare triple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} assume true; {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} is VALID [2022-04-27 11:07:41,946 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17968#(exists ((v_main_~x~0.offset_BEFORE_CALL_112 Int) (v_main_~x~0.base_BEFORE_CALL_112 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_112) (+ v_main_~x~0.offset_BEFORE_CALL_112 28)) 0))} {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} #68#return; {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} is VALID [2022-04-27 11:07:41,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} havoc #t~mem5; {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} is VALID [2022-04-27 11:07:41,947 INFO L290 TraceCheckUtils]: 84: Hoare triple {18112#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 7 main_~i~1))} is VALID [2022-04-27 11:07:41,948 INFO L290 TraceCheckUtils]: 85: Hoare triple {18137#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17871#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:07:41,948 INFO L272 TraceCheckUtils]: 86: Hoare triple {17871#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:07:41,948 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:07:41,949 INFO L290 TraceCheckUtils]: 88: Hoare triple {18148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17819#false} is VALID [2022-04-27 11:07:41,949 INFO L290 TraceCheckUtils]: 89: Hoare triple {17819#false} assume !false; {17819#false} is VALID [2022-04-27 11:07:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-27 11:07:41,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:07:44,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 28)) 0)) is different from false [2022-04-27 11:07:44,735 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 11:07:44,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-27 11:07:44,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {17819#false} assume !false; {17819#false} is VALID [2022-04-27 11:07:44,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {18148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17819#false} is VALID [2022-04-27 11:07:44,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:07:44,863 INFO L272 TraceCheckUtils]: 86: Hoare triple {17871#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:07:44,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {17870#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17871#(= |main_#t~mem5| 0)} is VALID [2022-04-27 11:07:44,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17870#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:07:44,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:07:44,865 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17818#true} {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:07:44,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,866 INFO L272 TraceCheckUtils]: 78: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,866 INFO L290 TraceCheckUtils]: 77: Hoare triple {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:07:44,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17865#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-27 11:07:44,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:07:44,867 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17818#true} {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:07:44,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,868 INFO L290 TraceCheckUtils]: 71: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,868 INFO L272 TraceCheckUtils]: 70: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,868 INFO L290 TraceCheckUtils]: 69: Hoare triple {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:07:44,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-27 11:07:44,869 INFO L290 TraceCheckUtils]: 67: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:07:44,869 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17818#true} {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:07:44,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,870 INFO L272 TraceCheckUtils]: 62: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:07:44,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17855#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-27 11:07:44,871 INFO L290 TraceCheckUtils]: 59: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:07:44,871 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17818#true} {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:07:44,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,872 INFO L272 TraceCheckUtils]: 54: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:07:44,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17850#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-27 11:07:44,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:07:44,873 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17818#true} {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:07:44,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,874 INFO L272 TraceCheckUtils]: 46: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:07:44,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-27 11:07:44,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:07:44,875 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17818#true} {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:07:44,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,875 INFO L272 TraceCheckUtils]: 38: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:07:44,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17840#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-27 11:07:44,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:07:44,877 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17818#true} {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:07:44,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {17818#true} assume !(0 == ~cond); {17818#true} is VALID [2022-04-27 11:07:44,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {17818#true} ~cond := #in~cond; {17818#true} is VALID [2022-04-27 11:07:44,877 INFO L272 TraceCheckUtils]: 30: Hoare triple {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {17818#true} is VALID [2022-04-27 11:07:44,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:07:44,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {18314#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-27 11:07:44,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:44,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:44,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {18348#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 28)) 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17834#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-27 11:07:44,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {18348#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 28)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18348#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 28)) 0))} is VALID [2022-04-27 11:07:44,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {17833#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18348#(forall ((main_~i~0 Int)) (= (select (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4)) 0) (+ main_~x~0.offset 28)) 0))} is VALID [2022-04-27 11:07:44,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {18358#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (<= main_~i~0 6)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17833#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (= (+ main_~x~0.offset 28) (+ main_~x~0.offset (* main_~i~0 4)))))} is VALID [2022-04-27 11:07:44,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {17830#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18358#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (not (<= main_~i~0 6)))} is VALID [2022-04-27 11:07:44,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17830#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 11:07:44,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:07:44,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17829#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 11:07:44,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:07:44,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17828#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 11:07:44,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:07:44,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17827#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 11:07:44,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:07:44,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17826#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 11:07:44,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:07:44,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17825#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 11:07:44,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:07:44,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {17823#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17824#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:07:44,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {17823#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {17823#(= main_~i~0 0)} is VALID [2022-04-27 11:07:44,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {17818#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {17823#(= main_~i~0 0)} is VALID [2022-04-27 11:07:44,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {17818#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17818#true} is VALID [2022-04-27 11:07:44,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {17818#true} call #t~ret6 := main(); {17818#true} is VALID [2022-04-27 11:07:44,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17818#true} {17818#true} #70#return; {17818#true} is VALID [2022-04-27 11:07:44,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {17818#true} assume true; {17818#true} is VALID [2022-04-27 11:07:44,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {17818#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(9, 2); {17818#true} is VALID [2022-04-27 11:07:44,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {17818#true} call ULTIMATE.init(); {17818#true} is VALID [2022-04-27 11:07:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 14 proven. 179 refuted. 0 times theorem prover too weak. 84 trivial. 19 not checked. [2022-04-27 11:07:44,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472425656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:07:44,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:07:44,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-04-27 11:07:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939051588] [2022-04-27 11:07:44,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:07:44,889 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 36 states have internal predecessors, (91), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 90 [2022-04-27 11:07:44,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:44,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 36 states have internal predecessors, (91), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:07:44,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-27 11:07:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-27 11:07:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1287, Unknown=9, NotChecked=72, Total=1482 [2022-04-27 11:07:44,978 INFO L87 Difference]: Start difference. First operand 171 states and 180 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 36 states have internal predecessors, (91), 16 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:07:46,101 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset 28)) 0) (<= 8 c_main_~i~0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 28)) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 11:07:46,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0.offset 28))) (and (= (select (select |c_#memory_int| c_main_~x~0.base) .cse0) 0) (not (= .cse0 (+ (* c_main_~i~0 4) c_main_~x~0.offset))) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 28)) 0)))) is different from false [2022-04-27 11:07:47,040 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset 28)) 0) (forall ((main_~i~0 Int)) (= (select (store (select |c_#memory_int| c_main_~x~0.base) (+ c_main_~x~0.offset (* main_~i~0 4)) 0) (+ c_main_~x~0.offset 28)) 0))) is different from false