/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:32:31,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:32:31,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:32:31,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:32:31,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:32:31,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:32:31,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:32:31,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:32:31,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:32:31,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:32:31,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:32:31,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:32:31,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:32:31,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:32:31,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:32:31,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:32:31,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:32:31,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:32:31,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:32:31,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:32:31,882 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:32:31,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:32:31,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:32:31,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:32:31,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:32:31,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:32:31,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:32:31,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:32:31,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:32:31,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:32:31,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:32:31,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:32:31,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:32:31,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:32:31,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:32:31,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:32:31,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:32:31,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:32:31,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:32:31,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:32:31,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:32:31,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:32:31,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:32:31,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:32:31,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:32:31,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:32:31,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:32:31,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:32:31,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:32:31,916 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:32:31,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:32:31,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:32:31,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:32:31,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:32:31,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:32:31,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:32:31,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:32:31,919 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:32:31,919 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-07 23:32:32,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:32:32,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:32:32,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:32:32,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:32:32,119 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:32:32,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-07 23:32:32,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3809f90/7a0442f97d664162b924b45c22765911/FLAGb1c458c37 [2022-04-07 23:32:32,551 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:32:32,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-07 23:32:32,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3809f90/7a0442f97d664162b924b45c22765911/FLAGb1c458c37 [2022-04-07 23:32:32,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3809f90/7a0442f97d664162b924b45c22765911 [2022-04-07 23:32:32,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:32:32,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:32:32,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:32:32,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:32:32,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:32:32,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76451740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32, skipping insertion in model container [2022-04-07 23:32:32,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:32:32,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:32:32,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-07 23:32:32,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:32:32,752 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:32:32,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-07 23:32:32,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:32:32,782 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:32:32,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32 WrapperNode [2022-04-07 23:32:32,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:32:32,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:32:32,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:32:32,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:32:32,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:32:32,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:32:32,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:32:32,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:32:32,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (1/1) ... [2022-04-07 23:32:32,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:32:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:32:32,860 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-07 23:32:32,876 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-07 23:32:32,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:32:32,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:32:32,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:32:32,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:32:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:32:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:32:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:32:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:32:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:32:32,954 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:32:32,955 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:32:33,099 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:32:33,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:32:33,104 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 23:32:33,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:33 BoogieIcfgContainer [2022-04-07 23:32:33,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:32:33,106 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:32:33,106 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:32:33,113 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:32:33,115 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:33" (1/1) ... [2022-04-07 23:32:33,116 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:32:33,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:32:33 BasicIcfg [2022-04-07 23:32:33,146 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:32:33,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:32:33,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:32:33,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:32:33,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:32:32" (1/4) ... [2022-04-07 23:32:33,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de32044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:32:33, skipping insertion in model container [2022-04-07 23:32:33,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:32" (2/4) ... [2022-04-07 23:32:33,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de32044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:32:33, skipping insertion in model container [2022-04-07 23:32:33,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:33" (3/4) ... [2022-04-07 23:32:33,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de32044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:32:33, skipping insertion in model container [2022-04-07 23:32:33,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:32:33" (4/4) ... [2022-04-07 23:32:33,151 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.cqvasr [2022-04-07 23:32:33,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:32:33,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:32:33,179 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:32:33,183 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-07 23:32:33,183 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:32:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 23:32:33,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:33,198 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-07 23:32:33,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash 64952803, now seen corresponding path program 1 times [2022-04-07 23:32:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:33,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937233372] [2022-04-07 23:32:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:33,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 23:32:33,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:33,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 23:32:33,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-07 23:32:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:33,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {42#true} is VALID [2022-04-07 23:32:33,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {43#false} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {43#false} is VALID [2022-04-07 23:32:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-07 23:32:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:33,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 23:32:33,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-07 23:32:33,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:33,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 23:32:33,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [90] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~n~0] {42#true} is VALID [2022-04-07 23:32:33,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [92] L19-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 23:32:33,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 23:32:33,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,425 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-07 23:32:33,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [93] L19-1-->L20: Formula: (and (= (store |v_#length_2| |v_main_#t~malloc6.base_1| (* v_main_~n~0_5 4)) |v_#length_1|) (= (store |v_#valid_2| |v_main_#t~malloc6.base_1| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_#t~malloc6.base_1|) 0) (not (= 0 |v_main_#t~malloc6.base_1|)) (< |v_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (= |v_main_#t~malloc6.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] {43#false} is VALID [2022-04-07 23:32:33,425 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} [95] L20-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {59#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:33,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {42#true} is VALID [2022-04-07 23:32:33,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 23:32:33,426 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {43#false} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {43#false} is VALID [2022-04-07 23:32:33,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [98] L20-1-->L35-2: Formula: (and (= |v_main_#t~malloc6.offset_3| v_main_~a~0.offset_3) (= v_main_~a~0.base_3 |v_main_#t~malloc6.base_3|) (= (+ (- 1) v_main_~n~0_8) v_main_~y~0_1) (= v_main_~x~0_3 0)) InVars {main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} OutVars{main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_3, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_~a~0.offset=v_main_~a~0.offset_3, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} AuxVars[] AssignedVars[main_~x~0, main_~a~0.base, main_~y~0, main_~a~0.offset] {43#false} is VALID [2022-04-07 23:32:33,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [101] L35-2-->L25-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} [105] L25-2-->L42: Formula: (and (= v_main_~i~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0, main_#t~nondet11] {43#false} is VALID [2022-04-07 23:32:33,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {43#false} [109] L42-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 23:32:33,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 23:32:33,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43#false} {43#false} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-07 23:32:33,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#false} [108] L42-1-->L43: Formula: (let ((.cse0 (select |v_#memory_int_1| v_main_~a~0.base_1))) (and (= |v_main_#t~mem13_1| (select .cse0 (+ (* v_main_~x~0_1 4) v_main_~a~0.offset_1))) (= |v_main_#t~mem12_1| (select .cse0 (+ v_main_~a~0.offset_1 (* v_main_~i~0_5 4)))))) InVars {main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~x~0=v_main_~x~0_1, main_~a~0.offset=v_main_~a~0.offset_1} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_~x~0=v_main_~x~0_1, main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13] {43#false} is VALID [2022-04-07 23:32:33,430 INFO L272 TraceCheckUtils]: 25: Hoare triple {43#false} [110] L43-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {43#false} is VALID [2022-04-07 23:32:33,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-07 23:32:33,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} [116] L11-->L11-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {43#false} [120] L11-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 23:32:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:32:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:33,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937233372] [2022-04-07 23:32:33,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937233372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:33,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:33,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:32:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233545261] [2022-04-07 23:32:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-07 23:32:33,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:33,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:33,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:33,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:32:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:32:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:32:33,502 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:33,725 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-07 23:32:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:32:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-07 23:32:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-04-07 23:32:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-04-07 23:32:33,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2022-04-07 23:32:33,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:33,837 INFO L225 Difference]: With dead ends: 71 [2022-04-07 23:32:33,837 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 23:32:33,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:32:33,842 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:33,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:32:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 23:32:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 23:32:33,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:33,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:33,865 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:33,866 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:33,875 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 23:32:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 23:32:33,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:33,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:33,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-07 23:32:33,878 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-07 23:32:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:33,883 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 23:32:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 23:32:33,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:33,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:33,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:33,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 23:32:33,889 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-07 23:32:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:33,889 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 23:32:33,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 23:32:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 23:32:33,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:33,891 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-07 23:32:33,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:32:33,892 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2146770526, now seen corresponding path program 1 times [2022-04-07 23:32:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:33,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386922249] [2022-04-07 23:32:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {275#true} is VALID [2022-04-07 23:32:34,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {275#true} is VALID [2022-04-07 23:32:34,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {275#true} is VALID [2022-04-07 23:32:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:34,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:34,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {275#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {287#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-07 23:32:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-07 23:32:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {275#true} is VALID [2022-04-07 23:32:34,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-07 23:32:34,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:34,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {275#true} is VALID [2022-04-07 23:32:34,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} [90] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~n~0] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {275#true} [92] L19-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {275#true} {275#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {275#true} is VALID [2022-04-07 23:32:34,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#true} [93] L19-1-->L20: Formula: (and (= (store |v_#length_2| |v_main_#t~malloc6.base_1| (* v_main_~n~0_5 4)) |v_#length_1|) (= (store |v_#valid_2| |v_main_#t~malloc6.base_1| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_#t~malloc6.base_1|) 0) (not (= 0 |v_main_#t~malloc6.base_1|)) (< |v_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (= |v_main_#t~malloc6.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] {275#true} is VALID [2022-04-07 23:32:34,116 INFO L272 TraceCheckUtils]: 12: Hoare triple {275#true} [95] L20-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {298#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:34,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {298#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:34,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:34,118 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {275#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {287#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-07 23:32:34,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {287#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} [98] L20-1-->L35-2: Formula: (and (= |v_main_#t~malloc6.offset_3| v_main_~a~0.offset_3) (= v_main_~a~0.base_3 |v_main_#t~malloc6.base_3|) (= (+ (- 1) v_main_~n~0_8) v_main_~y~0_1) (= v_main_~x~0_3 0)) InVars {main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} OutVars{main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_3, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_~a~0.offset=v_main_~a~0.offset_3, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} AuxVars[] AssignedVars[main_~x~0, main_~a~0.base, main_~y~0, main_~a~0.offset] {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:34,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [102] L35-2-->L25-2: Formula: (not (< v_main_~x~0_4 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:34,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [105] L25-2-->L42: Formula: (and (= v_main_~i~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0, main_#t~nondet11] {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-07 23:32:34,120 INFO L272 TraceCheckUtils]: 19: Hoare triple {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [109] L42-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {275#true} is VALID [2022-04-07 23:32:34,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {275#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {275#true} is VALID [2022-04-07 23:32:34,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {275#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {275#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-07 23:32:34,121 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {275#true} {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-07 23:32:34,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [108] L42-1-->L43: Formula: (let ((.cse0 (select |v_#memory_int_1| v_main_~a~0.base_1))) (and (= |v_main_#t~mem13_1| (select .cse0 (+ (* v_main_~x~0_1 4) v_main_~a~0.offset_1))) (= |v_main_#t~mem12_1| (select .cse0 (+ v_main_~a~0.offset_1 (* v_main_~i~0_5 4)))))) InVars {main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~x~0=v_main_~x~0_1, main_~a~0.offset=v_main_~a~0.offset_1} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_~x~0=v_main_~x~0_1, main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13] {294#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} is VALID [2022-04-07 23:32:34,122 INFO L272 TraceCheckUtils]: 25: Hoare triple {294#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} [110] L43-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {295#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:32:34,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {295#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {296#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:32:34,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#(not (= __VERIFIER_assert_~cond 0))} [116] L11-->L11-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-07 23:32:34,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {276#false} [120] L11-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-07 23:32:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:32:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:34,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386922249] [2022-04-07 23:32:34,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386922249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:34,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:34,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-07 23:32:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816082107] [2022-04-07 23:32:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-07 23:32:34,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:34,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:34,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:34,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 23:32:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 23:32:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-04-07 23:32:34,151 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:34,711 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-07 23:32:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 23:32:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-07 23:32:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-07 23:32:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-07 23:32:34,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2022-04-07 23:32:34,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:34,752 INFO L225 Difference]: With dead ends: 40 [2022-04-07 23:32:34,752 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 23:32:34,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:32:34,753 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:34,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 37 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 23:32:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 23:32:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-07 23:32:34,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:34,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:34,762 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:34,762 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:34,768 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-07 23:32:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-07 23:32:34,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:34,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:34,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-07 23:32:34,771 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-07 23:32:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:34,776 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-07 23:32:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-07 23:32:34,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:34,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:34,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:34,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 23:32:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-07 23:32:34,781 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2022-04-07 23:32:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:34,781 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-07 23:32:34,781 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:32:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-07 23:32:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 23:32:34,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:34,785 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-07 23:32:34,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:32:34,785 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash -359953696, now seen corresponding path program 1 times [2022-04-07 23:32:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:34,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390843422] [2022-04-07 23:32:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {503#true} is VALID [2022-04-07 23:32:34,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:34,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {503#true} {503#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {503#true} is VALID [2022-04-07 23:32:34,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:34,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:34,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {503#true} is VALID [2022-04-07 23:32:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:34,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:34,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {503#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {515#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-07 23:32:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-07 23:32:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:34,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {503#true} is VALID [2022-04-07 23:32:34,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:34,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:34,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 23:32:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:35,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#true} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {503#true} is VALID [2022-04-07 23:32:35,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} [117] L11-->L11-3: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} [122] L11-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} [130] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:35,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {503#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:35,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {503#true} is VALID [2022-04-07 23:32:35,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {503#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {503#true} [90] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~n~0] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {503#true} [92] L19-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {503#true} {503#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {503#true} is VALID [2022-04-07 23:32:35,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#true} [93] L19-1-->L20: Formula: (and (= (store |v_#length_2| |v_main_#t~malloc6.base_1| (* v_main_~n~0_5 4)) |v_#length_1|) (= (store |v_#valid_2| |v_main_#t~malloc6.base_1| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_#t~malloc6.base_1|) 0) (not (= 0 |v_main_#t~malloc6.base_1|)) (< |v_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (= |v_main_#t~malloc6.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] {503#true} is VALID [2022-04-07 23:32:35,006 INFO L272 TraceCheckUtils]: 12: Hoare triple {503#true} [95] L20-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {531#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:35,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:35,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:35,008 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {503#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {515#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-07 23:32:35,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {515#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} [98] L20-1-->L35-2: Formula: (and (= |v_main_#t~malloc6.offset_3| v_main_~a~0.offset_3) (= v_main_~a~0.base_3 |v_main_#t~malloc6.base_3|) (= (+ (- 1) v_main_~n~0_8) v_main_~y~0_1) (= v_main_~x~0_3 0)) InVars {main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} OutVars{main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_3, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_~a~0.offset=v_main_~a~0.offset_3, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} AuxVars[] AssignedVars[main_~x~0, main_~a~0.base, main_~y~0, main_~a~0.offset] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:35,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [102] L35-2-->L25-2: Formula: (not (< v_main_~x~0_4 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:35,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [105] L25-2-->L42: Formula: (and (= v_main_~i~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0, main_#t~nondet11] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:35,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [109] L42-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {503#true} is VALID [2022-04-07 23:32:35,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {503#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {503#true} is VALID [2022-04-07 23:32:35,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {503#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {503#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,010 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {503#true} {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:35,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [108] L42-1-->L43: Formula: (let ((.cse0 (select |v_#memory_int_1| v_main_~a~0.base_1))) (and (= |v_main_#t~mem13_1| (select .cse0 (+ (* v_main_~x~0_1 4) v_main_~a~0.offset_1))) (= |v_main_#t~mem12_1| (select .cse0 (+ v_main_~a~0.offset_1 (* v_main_~i~0_5 4)))))) InVars {main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~x~0=v_main_~x~0_1, main_~a~0.offset=v_main_~a~0.offset_1} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_~x~0=v_main_~x~0_1, main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13] {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} is VALID [2022-04-07 23:32:35,011 INFO L272 TraceCheckUtils]: 25: Hoare triple {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} [110] L43-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {503#true} is VALID [2022-04-07 23:32:35,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {503#true} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {503#true} is VALID [2022-04-07 23:32:35,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {503#true} [117] L11-->L11-3: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {503#true} [122] L11-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#true} is VALID [2022-04-07 23:32:35,012 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {503#true} {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} [130] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:35,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [111] L43-1-->L45-3: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_~i~0=v_main_~i~0_6, main_#t~mem13=|v_main_#t~mem13_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_~i~0] {526#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} is VALID [2022-04-07 23:32:35,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {526#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} [115] L45-3-->L46: Formula: (let ((.cse0 (select |v_#memory_int_4| v_main_~a~0.base_2))) (and (= (select .cse0 (+ v_main_~a~0.offset_2 (* v_main_~i~0_8 4))) |v_main_#t~mem15_1|) (< v_main_~i~0_8 v_main_~n~0_7) (= |v_main_#t~mem16_1| (select .cse0 (+ v_main_~a~0.offset_2 (* v_main_~x~0_2 4)))))) InVars {main_~x~0=v_main_~x~0_2, main_~a~0.base=v_main_~a~0.base_2, #memory_int=|v_#memory_int_4|, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~a~0.offset=v_main_~a~0.offset_2} OutVars{main_#t~mem15=|v_main_#t~mem15_1|, main_~x~0=v_main_~x~0_2, main_~a~0.base=v_main_~a~0.base_2, #memory_int=|v_#memory_int_4|, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_#t~mem16=|v_main_#t~mem16_1|, main_~a~0.offset=v_main_~a~0.offset_2} AuxVars[] AssignedVars[main_#t~mem15, main_#t~mem16] {527#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} is VALID [2022-04-07 23:32:35,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {527#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} [119] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem15_4| |v_main_#t~mem16_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_#t~mem16=|v_main_#t~mem16_4|, main_#t~mem15=|v_main_#t~mem15_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem15, main_#t~mem16] {528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:32:35,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {528#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {529#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:32:35,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {529#(not (= __VERIFIER_assert_~cond 0))} [116] L11-->L11-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {504#false} is VALID [2022-04-07 23:32:35,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {504#false} [120] L11-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {504#false} is VALID [2022-04-07 23:32:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:32:35,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:35,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390843422] [2022-04-07 23:32:35,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390843422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:35,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:35,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-07 23:32:35,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132837720] [2022-04-07 23:32:35,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:35,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-07 23:32:35,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:35,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 23:32:35,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:35,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 23:32:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 23:32:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-04-07 23:32:35,035 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 23:32:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:35,561 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-07 23:32:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 23:32:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-07 23:32:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 23:32:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-07 23:32:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 23:32:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-07 23:32:35,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-07 23:32:35,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:35,600 INFO L225 Difference]: With dead ends: 38 [2022-04-07 23:32:35,600 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:32:35,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:32:35,601 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:35,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 40 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 23:32:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:32:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:32:35,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:35,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:35,602 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:35,602 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:35,602 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:32:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:35,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:35,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:35,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:32:35,603 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:32:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:35,603 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:32:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:35,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:35,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:35,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:35,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:32:35,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-07 23:32:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:35,603 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:32:35,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 23:32:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:35,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:35,605 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:32:35,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 23:32:35,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:32:35,652 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:32:35,652 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-07 23:32:35,652 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 25 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L25-2(lines 25 37) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 36) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem12| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (= |main_#t~mem13| 0))) [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L45-3(lines 45 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-07 23:32:35,653 INFO L882 garLoopResultBuilder]: For program point L45-4(lines 45 47) no Hoare annotation was computed. [2022-04-07 23:32:35,653 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= |main_#t~mem15| 0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (<= 0 |main_#t~mem16|))) [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 51) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 51) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point L11-3(lines 10 12) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:35,654 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:35,656 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 23:32:35,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 23:32:35,660 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-07 23:32:35,661 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-04-07 23:32:35,662 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-04-07 23:32:35,663 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-07 23:32:35,663 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-04-07 23:32:35,663 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:32:35,663 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:32:35,663 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:32:35,663 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:32:35,666 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-07 23:32:35,668 INFO L158 Benchmark]: Toolchain (without parser) took 3095.91ms. Allocated memory was 256.9MB in the beginning and 346.0MB in the end (delta: 89.1MB). Free memory was 229.7MB in the beginning and 238.7MB in the end (delta: -9.0MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2022-04-07 23:32:35,668 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 256.9MB. Free memory is still 215.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:32:35,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.11ms. Allocated memory was 256.9MB in the beginning and 346.0MB in the end (delta: 89.1MB). Free memory was 229.3MB in the beginning and 315.7MB in the end (delta: -86.4MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-07 23:32:35,668 INFO L158 Benchmark]: Boogie Preprocessor took 42.19ms. Allocated memory is still 346.0MB. Free memory was 315.7MB in the beginning and 313.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:35,668 INFO L158 Benchmark]: RCFGBuilder took 278.17ms. Allocated memory is still 346.0MB. Free memory was 313.9MB in the beginning and 300.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 23:32:35,669 INFO L158 Benchmark]: IcfgTransformer took 40.57ms. Allocated memory is still 346.0MB. Free memory was 300.7MB in the beginning and 298.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:35,669 INFO L158 Benchmark]: TraceAbstraction took 2519.62ms. Allocated memory is still 346.0MB. Free memory was 298.2MB in the beginning and 238.7MB in the end (delta: 59.5MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. [2022-04-07 23:32:35,670 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 256.9MB. Free memory is still 215.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.11ms. Allocated memory was 256.9MB in the beginning and 346.0MB in the end (delta: 89.1MB). Free memory was 229.3MB in the beginning and 315.7MB in the end (delta: -86.4MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.19ms. Allocated memory is still 346.0MB. Free memory was 315.7MB in the beginning and 313.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.17ms. Allocated memory is still 346.0MB. Free memory was 313.9MB in the beginning and 300.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 40.57ms. Allocated memory is still 346.0MB. Free memory was 300.7MB in the beginning and 298.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2519.62ms. Allocated memory is still 346.0MB. Free memory was 298.2MB in the beginning and 238.7MB in the end (delta: 59.5MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 496 IncrementalHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 87 mSDtfsCounter, 496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 20 PreInvPairs, 26 NumberOfFragments, 100 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-07 23:32:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...