/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/loops/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:20:02,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:20:02,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:20:02,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:20:02,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:20:02,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:20:02,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:20:02,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:20:02,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:20:02,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:20:02,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:20:02,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:20:02,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:20:02,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:20:02,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:20:02,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:20:02,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:20:02,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:20:02,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:20:02,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:20:02,878 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:20:02,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:20:02,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:20:02,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:20:02,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:20:02,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:20:02,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:20:02,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:20:02,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:20:02,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:20:02,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:20:02,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:20:02,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:20:02,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:20:02,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:20:02,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:20:02,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:20:02,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:20:02,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:20:02,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:20:02,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:20:02,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:20:02,893 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:20:02,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:20:02,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:20:02,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:20:02,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:20:02,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:20:02,916 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:20:02,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:20:02,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:20:02,916 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:20:02,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:20:02,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:20:02,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:20:02,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:20:02,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:20:02,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:20:02,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:20:02,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:20:02,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:20:02,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:20:02,920 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:20:03,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:20:03,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:20:03,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:20:03,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:20:03,083 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:20:03,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2.i [2022-04-27 10:20:03,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4dff279/dcde545162b240309548891e2cfdb695/FLAGa7a0cea65 [2022-04-27 10:20:03,452 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:20:03,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2022-04-27 10:20:03,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4dff279/dcde545162b240309548891e2cfdb695/FLAGa7a0cea65 [2022-04-27 10:20:03,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4dff279/dcde545162b240309548891e2cfdb695 [2022-04-27 10:20:03,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:20:03,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:20:03,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:20:03,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:20:03,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:20:03,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:20:03" (1/1) ... [2022-04-27 10:20:03,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fff3060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:03, skipping insertion in model container [2022-04-27 10:20:03,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:20:03" (1/1) ... [2022-04-27 10:20:03,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:20:03,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:20:04,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i[938,951] [2022-04-27 10:20:04,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:20:04,068 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:20:04,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i[938,951] [2022-04-27 10:20:04,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:20:04,091 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:20:04,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04 WrapperNode [2022-04-27 10:20:04,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:20:04,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:20:04,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:20:04,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:20:04,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:20:04,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:20:04,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:20:04,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:20:04,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (1/1) ... [2022-04-27 10:20:04,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:20:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:04,138 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:20:04,141 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:20:04,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:20:04,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:20:04,171 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:20:04,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:20:04,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:20:04,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:20:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:20:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:20:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:20:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:20:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:20:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:20:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:20:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:20:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:20:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:20:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:20:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:20:04,250 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:20:04,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:20:04,458 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:20:04,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:20:04,465 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 10:20:04,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:20:04 BoogieIcfgContainer [2022-04-27 10:20:04,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:20:04,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:20:04,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:20:04,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:20:04,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:20:03" (1/3) ... [2022-04-27 10:20:04,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce629b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:20:04, skipping insertion in model container [2022-04-27 10:20:04,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:04" (2/3) ... [2022-04-27 10:20:04,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce629b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:20:04, skipping insertion in model container [2022-04-27 10:20:04,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:20:04" (3/3) ... [2022-04-27 10:20:04,481 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2022-04-27 10:20:04,490 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:20:04,490 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:20:04,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:20:04,529 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@16276916, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@683405a1 [2022-04-27 10:20:04,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:20:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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:20:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:20:04,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:04,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:04,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689087, now seen corresponding path program 1 times [2022-04-27 10:20:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:04,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001334142] [2022-04-27 10:20:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:04,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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(14, 2); {35#true} is VALID [2022-04-27 10:20:04,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 10:20:04,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #102#return; {35#true} is VALID [2022-04-27 10:20:04,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:04,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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(14, 2); {35#true} is VALID [2022-04-27 10:20:04,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 10:20:04,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #102#return; {35#true} is VALID [2022-04-27 10:20:04,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret15 := main(); {35#true} is VALID [2022-04-27 10:20:04,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {35#true} is VALID [2022-04-27 10:20:04,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {35#true} is VALID [2022-04-27 10:20:04,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2022-04-27 10:20:04,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-04-27 10:20:04,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2022-04-27 10:20:04,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {36#false} is VALID [2022-04-27 10:20:04,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2022-04-27 10:20:04,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {36#false} is VALID [2022-04-27 10:20:04,718 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {36#false} is VALID [2022-04-27 10:20:04,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 10:20:04,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 10:20:04,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 10:20:04,719 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:20:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:04,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001334142] [2022-04-27 10:20:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001334142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:20:04,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:20:04,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:20:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714544686] [2022-04-27 10:20:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:20:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-27 10:20:04,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:04,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:20:04,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:04,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:20:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:20:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:20:04,777 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:20:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:04,835 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-27 10:20:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:20:04,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-27 10:20:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:20:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-27 10:20:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:20:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-27 10:20:04,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-27 10:20:04,916 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:20:04,922 INFO L225 Difference]: With dead ends: 55 [2022-04-27 10:20:04,923 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 10:20:04,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:20:04,930 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:04,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:20:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 10:20:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 10:20:04,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:04,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:20:04,958 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:20:04,958 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:20:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:04,968 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 10:20:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 10:20:04,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:04,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:04,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 27 states. [2022-04-27 10:20:04,971 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 27 states. [2022-04-27 10:20:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:04,978 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 10:20:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 10:20:04,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:04,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:04,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:04,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:20:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-27 10:20:04,982 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2022-04-27 10:20:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:04,983 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-27 10:20:04,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:20:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 10:20:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:20:04,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:04,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:04,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:20:04,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -717013641, now seen corresponding path program 1 times [2022-04-27 10:20:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:04,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460779656] [2022-04-27 10:20:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:05,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(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(14, 2); {204#true} is VALID [2022-04-27 10:20:05,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-27 10:20:05,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #102#return; {204#true} is VALID [2022-04-27 10:20:05,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:05,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(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(14, 2); {204#true} is VALID [2022-04-27 10:20:05,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-27 10:20:05,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #102#return; {204#true} is VALID [2022-04-27 10:20:05,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret15 := main(); {204#true} is VALID [2022-04-27 10:20:05,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {209#(= main_~i~0 0)} is VALID [2022-04-27 10:20:05,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-27 10:20:05,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-27 10:20:05,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-27 10:20:05,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-27 10:20:05,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-27 10:20:05,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {211#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:20:05,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {205#false} is VALID [2022-04-27 10:20:05,168 INFO L272 TraceCheckUtils]: 13: Hoare triple {205#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {205#false} is VALID [2022-04-27 10:20:05,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2022-04-27 10:20:05,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2022-04-27 10:20:05,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-27 10:20:05,168 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:20:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:05,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460779656] [2022-04-27 10:20:05,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460779656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:20:05,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:20:05,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:20:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394136078] [2022-04-27 10:20:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:20:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-27 10:20:05,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:05,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:20:05,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:05,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:20:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:05,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:20:05,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:20:05,189 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:20:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:05,447 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 10:20:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:20:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-27 10:20:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:20:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 10:20:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:20:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 10:20:05,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-27 10:20:05,536 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:20:05,538 INFO L225 Difference]: With dead ends: 62 [2022-04-27 10:20:05,538 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 10:20:05,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:20:05,539 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:05,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 35 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:20:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 10:20:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-27 10:20:05,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:05,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:20:05,544 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:20:05,544 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:20:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:05,546 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 10:20:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 10:20:05,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:05,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:05,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 39 states. [2022-04-27 10:20:05,547 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 39 states. [2022-04-27 10:20:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:05,549 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 10:20:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 10:20:05,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:05,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:05,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:05,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:20:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-27 10:20:05,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2022-04-27 10:20:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:05,551 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-27 10:20:05,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:20:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 10:20:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:20:05,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:05,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:05,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:20:05,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash -442514949, now seen corresponding path program 1 times [2022-04-27 10:20:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:05,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265837204] [2022-04-27 10:20:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:06,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {440#(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(14, 2); {425#true} is VALID [2022-04-27 10:20:06,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 10:20:06,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {425#true} {425#true} #102#return; {425#true} is VALID [2022-04-27 10:20:06,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:06,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {440#(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(14, 2); {425#true} is VALID [2022-04-27 10:20:06,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 10:20:06,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #102#return; {425#true} is VALID [2022-04-27 10:20:06,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret15 := main(); {425#true} is VALID [2022-04-27 10:20:06,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {431#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {432#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {433#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (or (not (= (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)) 0)) (not (= |main_~#B~0.base| |main_~#C~0.base|))))} is VALID [2022-04-27 10:20:06,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {433#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (or (not (= (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)) 0)) (not (= |main_~#B~0.base| |main_~#C~0.base|))))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {434#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= (* 17179869184 (div main_~i~0 4294967296)) (+ |main_~#A~0.offset| (* main_~i~0 4))) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-27 10:20:06,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {434#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= (* 17179869184 (div main_~i~0 4294967296)) (+ |main_~#A~0.offset| (* main_~i~0 4))) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {435#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {435#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:06,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {435#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {436#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-27 10:20:06,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {436#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {437#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-27 10:20:06,372 INFO L272 TraceCheckUtils]: 21: Hoare triple {437#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {438#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:20:06,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {438#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {439#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:20:06,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {426#false} is VALID [2022-04-27 10:20:06,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 10:20:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:20:06,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:06,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265837204] [2022-04-27 10:20:06,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265837204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:06,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323840387] [2022-04-27 10:20:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:06,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:06,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:06,395 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:20:06,430 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:20:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 10:20:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:06,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:06,589 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 14 treesize of output 12 [2022-04-27 10:20:06,723 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-27 10:20:06,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-04-27 10:20:07,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:20:07,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2022-04-27 10:20:07,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-27 10:20:07,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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(14, 2); {425#true} is VALID [2022-04-27 10:20:07,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 10:20:07,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #102#return; {425#true} is VALID [2022-04-27 10:20:07,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret15 := main(); {425#true} is VALID [2022-04-27 10:20:07,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {490#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:20:07,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {494#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {494#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {494#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {494#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {494#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:07,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {494#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {504#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:20:07,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {504#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {437#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-27 10:20:07,143 INFO L272 TraceCheckUtils]: 21: Hoare triple {437#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:07,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:07,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-27 10:20:07,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 10:20:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:20:07,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:20:07,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:20:07,518 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 195 treesize of output 199 [2022-04-27 10:20:10,635 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-04-27 10:20:10,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 51 [2022-04-27 10:20:10,735 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-04-27 10:20:10,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 30 [2022-04-27 10:20:11,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:20:11,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-04-27 10:20:11,507 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-27 10:20:11,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 87 [2022-04-27 10:20:12,734 INFO L356 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2022-04-27 10:20:12,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 169 [2022-04-27 10:20:13,131 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-27 10:20:13,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 1 [2022-04-27 10:20:13,643 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-27 10:20:13,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2022-04-27 10:20:14,078 INFO L356 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2022-04-27 10:20:14,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 120 [2022-04-27 10:20:14,367 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-27 10:20:14,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 1 [2022-04-27 10:20:17,920 INFO L356 Elim1Store]: treesize reduction 40, result has 70.8 percent of original size [2022-04-27 10:20:17,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 132 [2022-04-27 10:20:19,180 INFO L356 Elim1Store]: treesize reduction 40, result has 70.8 percent of original size [2022-04-27 10:20:19,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 697 treesize of output 473 [2022-04-27 10:20:22,531 INFO L356 Elim1Store]: treesize reduction 33, result has 74.4 percent of original size [2022-04-27 10:20:22,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 129 [2022-04-27 10:20:22,734 INFO L356 Elim1Store]: treesize reduction 108, result has 16.3 percent of original size [2022-04-27 10:20:22,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 112 [2022-04-27 10:20:22,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:20:22,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 827 treesize of output 585 [2022-04-27 10:20:44,290 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-27 10:20:44,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2022-04-27 10:20:44,296 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-27 10:20:44,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 1 [2022-04-27 10:20:44,320 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-27 10:20:44,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 1 [2022-04-27 10:20:44,347 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-27 10:20:44,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 827 treesize of output 1 [2022-04-27 10:20:44,370 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:20:44,387 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:20:44,410 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-27 10:20:44,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-04-27 10:20:44,434 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-27 10:20:44,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 1 [2022-04-27 10:20:44,445 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-27 10:20:44,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 1 [2022-04-27 10:20:44,471 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-27 10:20:44,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 1 [2022-04-27 10:20:44,481 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:20:44,533 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-27 10:20:44,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 799 treesize of output 1 [2022-04-27 10:20:44,548 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:20:44,590 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-27 10:20:44,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 402 treesize of output 1 [2022-04-27 10:20:44,606 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-27 10:20:44,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 1 [2022-04-27 10:20:44,633 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-27 10:20:44,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 1 [2022-04-27 10:20:44,645 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:20:44,665 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:20:44,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 10:20:44,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-27 10:20:44,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:44,779 INFO L272 TraceCheckUtils]: 21: Hoare triple {437#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:44,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {534#(and (or (= (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (- 17179869184) (* (mod main_~i~0 4294967296) 4) |main_~#A~0.offset|)) (select (select |#memory_int| |main_~#B~0.base|) (+ (- 17179869184) (* (mod main_~i~0 4294967296) 4) |main_~#B~0.offset|))) (select (select |#memory_int| |main_~#C~0.base|) (+ (- 17179869184) (* (mod main_~i~0 4294967296) 4) |main_~#C~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#C~0.offset|)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#A~0.offset|)) (select (select |#memory_int| |main_~#B~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#B~0.offset|))))))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {437#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-27 10:20:44,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} ~i~0 := 0; {534#(and (or (= (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (- 17179869184) (* (mod main_~i~0 4294967296) 4) |main_~#A~0.offset|)) (select (select |#memory_int| |main_~#B~0.base|) (+ (- 17179869184) (* (mod main_~i~0 4294967296) 4) |main_~#B~0.offset|))) (select (select |#memory_int| |main_~#C~0.base|) (+ (- 17179869184) (* (mod main_~i~0 4294967296) 4) |main_~#C~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#C~0.offset|)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#A~0.offset|)) (select (select |#memory_int| |main_~#B~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#B~0.offset|))))))} is VALID [2022-04-27 10:20:44,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {538#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {538#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} is VALID [2022-04-27 10:20:44,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {538#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} is VALID [2022-04-27 10:20:44,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {548#(and (= (* (mod main_~i~0 4294967296) 4) 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {538#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} is VALID [2022-04-27 10:20:44,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {548#(and (= (* (mod main_~i~0 4294967296) 4) 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {459#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:20:44,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret15 := main(); {425#true} is VALID [2022-04-27 10:20:44,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #102#return; {425#true} is VALID [2022-04-27 10:20:44,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 10:20:44,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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(14, 2); {425#true} is VALID [2022-04-27 10:20:44,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-27 10:20:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:20:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323840387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:20:44,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:20:44,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 22 [2022-04-27 10:20:44,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776192715] [2022-04-27 10:20:44,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:20:44,791 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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 25 [2022-04-27 10:20:44,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:44,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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:20:44,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:44,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:20:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:20:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:20:44,838 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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:20:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:46,221 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-27 10:20:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 10:20:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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 25 [2022-04-27 10:20:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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:20:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2022-04-27 10:20:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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:20:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2022-04-27 10:20:46,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 70 transitions. [2022-04-27 10:20:46,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:46,292 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:20:46,292 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 10:20:46,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1150, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 10:20:46,295 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 108 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:46,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 86 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:20:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 10:20:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-27 10:20:46,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:46,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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:20:46,307 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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:20:46,307 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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:20:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:46,309 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-27 10:20:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-27 10:20:46,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:46,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:46,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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 46 states. [2022-04-27 10:20:46,309 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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 46 states. [2022-04-27 10:20:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:46,311 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-27 10:20:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-27 10:20:46,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:46,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:46,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:46,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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:20:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-27 10:20:46,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2022-04-27 10:20:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:46,312 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-27 10:20:46,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 19 states have internal predecessors, (46), 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:20:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-27 10:20:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 10:20:46,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:46,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:46,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:20:46,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:46,530 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1587952174, now seen corresponding path program 1 times [2022-04-27 10:20:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:46,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250127850] [2022-04-27 10:20:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:46,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#(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(14, 2); {866#true} is VALID [2022-04-27 10:20:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:46,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {866#true} {866#true} #102#return; {866#true} is VALID [2022-04-27 10:20:46,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:20:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:46,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-27 10:20:46,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-27 10:20:46,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:46,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {867#false} #100#return; {867#false} is VALID [2022-04-27 10:20:46,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:46,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#(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(14, 2); {866#true} is VALID [2022-04-27 10:20:46,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:46,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #102#return; {866#true} is VALID [2022-04-27 10:20:46,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret15 := main(); {866#true} is VALID [2022-04-27 10:20:46,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {871#(= main_~i~0 0)} is VALID [2022-04-27 10:20:46,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {871#(= main_~i~0 0)} is VALID [2022-04-27 10:20:46,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(= main_~i~0 0)} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {871#(= main_~i~0 0)} is VALID [2022-04-27 10:20:46,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {872#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:20:46,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {873#(and (<= (div main_~i~0 4294967296) 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:20:46,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(and (<= (div main_~i~0 4294967296) 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {873#(and (<= (div main_~i~0 4294967296) 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:20:46,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#(and (<= (div main_~i~0 4294967296) 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:46,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:46,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} ~i~0 := 0; {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-27 10:20:46,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-27 10:20:46,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-27 10:20:46,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {876#(<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {876#(<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {867#false} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {867#false} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {867#false} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {867#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {867#false} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2022-04-27 10:20:46,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {867#false} is VALID [2022-04-27 10:20:46,771 INFO L272 TraceCheckUtils]: 24: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {866#true} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:46,772 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {866#true} {867#false} #100#return; {867#false} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {867#false} havoc #t~mem14;havoc #t~mem12;havoc #t~mem13; {867#false} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {867#false} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {867#false} is VALID [2022-04-27 10:20:46,772 INFO L272 TraceCheckUtils]: 32: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {867#false} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-27 10:20:46,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-27 10:20:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:20:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250127850] [2022-04-27 10:20:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250127850] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768133425] [2022-04-27 10:20:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:46,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:46,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:46,776 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:20:46,777 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:20:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:46,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:20:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:46,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:47,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-27 10:20:47,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(14, 2); {866#true} is VALID [2022-04-27 10:20:47,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:47,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #102#return; {866#true} is VALID [2022-04-27 10:20:47,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret15 := main(); {866#true} is VALID [2022-04-27 10:20:47,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {871#(= main_~i~0 0)} is VALID [2022-04-27 10:20:47,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {871#(= main_~i~0 0)} is VALID [2022-04-27 10:20:47,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(= main_~i~0 0)} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {871#(= main_~i~0 0)} is VALID [2022-04-27 10:20:47,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {872#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:20:47,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} ~i~0 := 0; {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-27 10:20:47,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-27 10:20:47,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-27 10:20:47,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {875#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {933#(and (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {933#(and (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0) (= (+ (- 1) main_~i~0) 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {867#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {867#false} is VALID [2022-04-27 10:20:47,291 INFO L272 TraceCheckUtils]: 24: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-27 10:20:47,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {867#false} assume !(0 == ~cond); {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {867#false} assume true; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {867#false} {867#false} #100#return; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {867#false} havoc #t~mem14;havoc #t~mem12;havoc #t~mem13; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {867#false} is VALID [2022-04-27 10:20:47,292 INFO L272 TraceCheckUtils]: 32: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-27 10:20:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:20:47,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:20:47,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-27 10:20:47,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-27 10:20:47,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-27 10:20:47,599 INFO L272 TraceCheckUtils]: 32: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {867#false} is VALID [2022-04-27 10:20:47,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {867#false} is VALID [2022-04-27 10:20:47,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {867#false} havoc #t~mem14;havoc #t~mem12;havoc #t~mem13; {867#false} is VALID [2022-04-27 10:20:47,600 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {866#true} {867#false} #100#return; {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-27 10:20:47,600 INFO L272 TraceCheckUtils]: 24: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {866#true} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {867#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {867#false} is VALID [2022-04-27 10:20:47,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2022-04-27 10:20:47,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {876#(<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {867#false} is VALID [2022-04-27 10:20:47,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(<= (+ main_~i~0 2 (* (div main_~M~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {876#(<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:20:47,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#(<= (+ main_~i~0 2 (* (div main_~M~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {1048#(<= (+ main_~i~0 2 (* (div main_~M~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0))} is VALID [2022-04-27 10:20:47,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(<= (+ main_~i~0 2 (* (div main_~M~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1048#(<= (+ main_~i~0 2 (* (div main_~M~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0))} is VALID [2022-04-27 10:20:47,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} ~i~0 := 0; {1048#(<= (+ main_~i~0 2 (* (div main_~M~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0))} is VALID [2022-04-27 10:20:47,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#(<= (div (+ (- 1) (mod main_~i~0 4294967296)) (- 4294967296)) 0)} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {874#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-27 10:20:47,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= (div (+ (- 1) (mod (+ main_~i~0 1) 4294967296)) (- 4294967296)) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1070#(<= (div (+ (- 1) (mod main_~i~0 4294967296)) (- 4294967296)) 0)} is VALID [2022-04-27 10:20:47,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= (div (+ (- 1) (mod (+ main_~i~0 1) 4294967296)) (- 4294967296)) 0)} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {1074#(<= (div (+ (- 1) (mod (+ main_~i~0 1) 4294967296)) (- 4294967296)) 0)} is VALID [2022-04-27 10:20:47,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {1074#(<= (div (+ (- 1) (mod (+ main_~i~0 1) 4294967296)) (- 4294967296)) 0)} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1074#(<= (div (+ (- 1) (mod (+ main_~i~0 1) 4294967296)) (- 4294967296)) 0)} is VALID [2022-04-27 10:20:47,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {1074#(<= (div (+ (- 1) (mod (+ main_~i~0 1) 4294967296)) (- 4294967296)) 0)} is VALID [2022-04-27 10:20:47,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret15 := main(); {866#true} is VALID [2022-04-27 10:20:47,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #102#return; {866#true} is VALID [2022-04-27 10:20:47,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-27 10:20:47,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(14, 2); {866#true} is VALID [2022-04-27 10:20:47,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-27 10:20:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:20:47,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768133425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:20:47,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:20:47,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-04-27 10:20:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727193002] [2022-04-27 10:20:47,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:20:47,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 10:20:47,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:47,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:20:47,647 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:20:47,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 10:20:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 10:20:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:20:47,649 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:20:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:48,426 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-04-27 10:20:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:20:48,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 10:20:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:20:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-04-27 10:20:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:20:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-04-27 10:20:48,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 83 transitions. [2022-04-27 10:20:48,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:48,521 INFO L225 Difference]: With dead ends: 83 [2022-04-27 10:20:48,521 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 10:20:48,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:20:48,524 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 148 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:48,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 44 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:20:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 10:20:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2022-04-27 10:20:48,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:48,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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:20:48,548 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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:20:48,549 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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:20:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:48,551 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-04-27 10:20:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-27 10:20:48,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:48,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:48,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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 62 states. [2022-04-27 10:20:48,556 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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 62 states. [2022-04-27 10:20:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:48,559 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-04-27 10:20:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-27 10:20:48,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:48,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:48,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:48,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 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:20:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-27 10:20:48,561 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 36 [2022-04-27 10:20:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:48,561 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-27 10:20:48,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:20:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-27 10:20:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:20:48,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:48,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:48,581 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:20:48,778 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,SelfDestructingSolverStorable3 [2022-04-27 10:20:48,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 479826701, now seen corresponding path program 2 times [2022-04-27 10:20:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:48,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090426999] [2022-04-27 10:20:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {1439#(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(14, 2); {1420#true} is VALID [2022-04-27 10:20:49,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-04-27 10:20:49,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1420#true} {1420#true} #102#return; {1420#true} is VALID [2022-04-27 10:20:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:20:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {1420#true} ~cond := #in~cond; {1420#true} is VALID [2022-04-27 10:20:49,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1420#true} assume !(0 == ~cond); {1420#true} is VALID [2022-04-27 10:20:49,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-04-27 10:20:49,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1420#true} {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #100#return; {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1420#true} call ULTIMATE.init(); {1439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:49,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#(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(14, 2); {1420#true} is VALID [2022-04-27 10:20:49,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-04-27 10:20:49,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1420#true} {1420#true} #102#return; {1420#true} is VALID [2022-04-27 10:20:49,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {1420#true} call #t~ret15 := main(); {1420#true} is VALID [2022-04-27 10:20:49,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {1420#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:20:49,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:20:49,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:20:49,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {1427#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {1425#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:20:49,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {1426#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {1428#(and (<= (div main_~i~0 4294967296) 0) (= |main_~#B~0.offset| 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)))) (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= (+ |main_~#A~0.offset| 4) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(and (<= (div main_~i~0 4294967296) 0) (= |main_~#B~0.offset| 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)))) (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= (+ |main_~#A~0.offset| 4) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1429#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {1429#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {1429#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {1429#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,775 INFO L272 TraceCheckUtils]: 29: Hoare triple {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {1420#true} is VALID [2022-04-27 10:20:49,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {1420#true} ~cond := #in~cond; {1420#true} is VALID [2022-04-27 10:20:49,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {1420#true} assume !(0 == ~cond); {1420#true} is VALID [2022-04-27 10:20:49,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-04-27 10:20:49,776 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1420#true} {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #100#return; {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} havoc #t~mem14;havoc #t~mem12;havoc #t~mem13; {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-27 10:20:49,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {1430#(and (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#A~0.offset| 4)))) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1435#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-27 10:20:49,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {1435#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1436#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-27 10:20:49,780 INFO L272 TraceCheckUtils]: 37: Hoare triple {1436#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {1437#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:20:49,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {1437#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1438#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:20:49,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {1438#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1421#false} is VALID [2022-04-27 10:20:49,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {1421#false} assume !false; {1421#false} is VALID [2022-04-27 10:20:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:20:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:49,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090426999] [2022-04-27 10:20:49,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090426999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:49,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540326072] [2022-04-27 10:20:49,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:20:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:49,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:49,791 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:20:49,794 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:20:49,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:20:49,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:20:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 10:20:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:49,897 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 14 treesize of output 12 [2022-04-27 10:20:50,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-27 10:20:50,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-27 10:20:50,105 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-04-27 10:20:50,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-04-27 10:21:00,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:21:00,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 31 [2022-04-27 10:21:00,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {1420#true} call ULTIMATE.init(); {1420#true} is VALID [2022-04-27 10:21:00,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1420#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(14, 2); {1420#true} is VALID [2022-04-27 10:21:00,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-04-27 10:21:00,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1420#true} {1420#true} #102#return; {1420#true} is VALID [2022-04-27 10:21:00,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1420#true} call #t~ret15 := main(); {1420#true} is VALID [2022-04-27 10:21:00,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {1420#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1493#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {1493#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {1468#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {1458#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1493#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {1518#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1518#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {1518#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {1518#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-27 10:21:00,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {1518#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,273 INFO L272 TraceCheckUtils]: 29: Hoare triple {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} is VALID [2022-04-27 10:21:00,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} ~cond := #in~cond; {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} is VALID [2022-04-27 10:21:00,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} assume !(0 == ~cond); {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} is VALID [2022-04-27 10:21:00,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} assume true; {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} is VALID [2022-04-27 10:21:00,277 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1535#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))))} {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} #100#return; {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} havoc #t~mem14;havoc #t~mem12;havoc #t~mem13; {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-27 10:21:00,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {1528#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1554#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:21:00,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {1554#(and (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {1436#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-27 10:21:00,279 INFO L272 TraceCheckUtils]: 37: Hoare triple {1436#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {1561#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:00,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {1561#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1565#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:00,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {1565#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1421#false} is VALID [2022-04-27 10:21:00,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {1421#false} assume !false; {1421#false} is VALID [2022-04-27 10:21:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:21:00,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:07,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod c_main_~i~0 4294967296) 2147483647))) (and (or .cse0 (forall ((|main_~#C~0.offset| Int) (|main_~#A~0.offset| Int)) (let ((.cse2 (let ((.cse3 (* (mod c_main_~i~0 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ (- 17179869184) .cse3 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ (- 17179869184) .cse3 |main_~#A~0.offset|)) (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ (- 17179869184) .cse3 |c_main_~#B~0.offset|))))))) (= (let ((.cse1 (store |c_#memory_int| |c_main_~#C~0.base| .cse2))) (+ (select (select .cse1 |c_main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select .cse1 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)))) (select .cse2 (+ |main_~#C~0.offset| 4)))))) (or (not .cse0) (forall ((|main_~#C~0.offset| Int) (|main_~#A~0.offset| Int)) (let ((.cse5 (let ((.cse6 (* (mod c_main_~i~0 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ .cse6 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ .cse6 |main_~#A~0.offset|)) (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ .cse6 |c_main_~#B~0.offset|))))))) (= (let ((.cse4 (store |c_#memory_int| |c_main_~#C~0.base| .cse5))) (+ (select (select .cse4 |c_main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select .cse4 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)))) (select .cse5 (+ |main_~#C~0.offset| 4)))))))) is different from false [2022-04-27 10:21:08,802 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((|main_~#C~0.offset| Int) (|main_~#A~0.offset| Int)) (let ((.cse1 (let ((.cse2 (* (mod (+ c_main_~i~0 1) 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ .cse2 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ .cse2 |main_~#A~0.offset|)) (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ .cse2 |c_main_~#B~0.offset|))))))) (= (let ((.cse0 (store |c_#memory_int| |c_main_~#C~0.base| .cse1))) (+ (select (select .cse0 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)) (select (select .cse0 |c_main_~#A~0.base|) (+ |main_~#A~0.offset| 4)))) (select .cse1 (+ |main_~#C~0.offset| 4))))) (not .cse3)) (or .cse3 (forall ((|main_~#C~0.offset| Int) (|main_~#A~0.offset| Int)) (let ((.cse5 (let ((.cse6 (* (mod (+ c_main_~i~0 1) 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ (- 17179869184) .cse6 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ (- 17179869184) .cse6 |main_~#A~0.offset|)) (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ (- 17179869184) .cse6 |c_main_~#B~0.offset|))))))) (= (let ((.cse4 (store |c_#memory_int| |c_main_~#C~0.base| .cse5))) (+ (select (select .cse4 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)) (select (select .cse4 |c_main_~#A~0.base|) (+ |main_~#A~0.offset| 4)))) (select .cse5 (+ |main_~#C~0.offset| 4)))))))) is different from false [2022-04-27 10:21:08,896 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (<= (mod (+ c_main_~i~0 1) 4294967296) 2147483647))) (and (or (forall ((|main_~#C~0.offset| Int) (v_ArrVal_134 (Array Int Int)) (|main_~#A~0.offset| Int)) (let ((.cse1 (let ((.cse2 (* (mod (+ c_main_~i~0 1) 4294967296) 4))) (store v_ArrVal_134 (+ .cse2 |main_~#C~0.offset|) (let ((.cse3 (store |c_#memory_int| |c_main_~#C~0.base| v_ArrVal_134))) (+ (select (select .cse3 |c_main_~#B~0.base|) (+ .cse2 |c_main_~#B~0.offset|)) (select (select .cse3 |c_main_~#A~0.base|) (+ .cse2 |main_~#A~0.offset|)))))))) (= (let ((.cse0 (store |c_#memory_int| |c_main_~#C~0.base| .cse1))) (+ (select (select .cse0 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)) (select (select .cse0 |c_main_~#A~0.base|) (+ |main_~#A~0.offset| 4)))) (select .cse1 (+ |main_~#C~0.offset| 4))))) (not .cse4)) (or .cse4 (forall ((|main_~#C~0.offset| Int) (v_ArrVal_134 (Array Int Int)) (|main_~#A~0.offset| Int)) (let ((.cse5 (let ((.cse7 (* (mod (+ c_main_~i~0 1) 4294967296) 4))) (store v_ArrVal_134 (+ (- 17179869184) .cse7 |main_~#C~0.offset|) (let ((.cse8 (store |c_#memory_int| |c_main_~#C~0.base| v_ArrVal_134))) (+ (select (select .cse8 |c_main_~#A~0.base|) (+ (- 17179869184) .cse7 |main_~#A~0.offset|)) (select (select .cse8 |c_main_~#B~0.base|) (+ (- 17179869184) .cse7 |c_main_~#B~0.offset|)))))))) (= (select .cse5 (+ |main_~#C~0.offset| 4)) (let ((.cse6 (store |c_#memory_int| |c_main_~#C~0.base| .cse5))) (+ (select (select .cse6 |c_main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (select (select .cse6 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)))))))))) is different from false [2022-04-27 10:21:08,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int) (v_ArrVal_134 (Array Int Int)) (|main_~#A~0.offset| Int)) (let ((.cse3 (+ |main_~#A~0.offset| 4)) (.cse2 (+ |c_main_~#B~0.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_main_~#C~0.base| v_ArrVal_134))) (+ (select (select .cse4 |c_main_~#A~0.base|) .cse3) (select (select .cse4 |c_main_~#B~0.base|) .cse2))))) (= .cse0 (let ((.cse1 (store |c_#memory_int| |c_main_~#C~0.base| (store v_ArrVal_134 (+ |main_~#C~0.offset| 4) .cse0)))) (+ (select (select .cse1 |c_main_~#B~0.base|) .cse2) (select (select .cse1 |c_main_~#A~0.base|) .cse3))))))) is different from false [2022-04-27 10:21:09,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:21:09,285 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 6267 treesize of output 6087 [2022-04-27 10:21:09,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:21:09,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10250 treesize of output 8054