./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condaf.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condaf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab2e7358ff54d79471e52cc95ead62df9f9f42221b613d220b916398bb7ee282 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:27:49,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:27:49,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:27:49,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:27:49,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:27:49,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:27:49,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:27:49,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:27:49,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:27:49,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:27:49,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:27:49,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:27:49,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:27:49,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:27:49,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:27:49,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:27:49,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:27:49,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:27:49,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:27:49,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:27:49,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:27:49,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:27:49,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:27:49,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:27:49,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:27:49,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:27:49,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:27:49,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:27:49,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:27:49,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:27:49,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:27:49,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:27:49,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:27:49,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:27:49,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:27:49,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:27:49,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:27:49,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:27:49,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:27:49,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:27:49,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:27:49,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:27:49,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:27:49,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:27:49,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:27:49,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:27:49,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:27:49,879 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:27:49,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:27:49,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:27:49,880 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:27:49,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:27:49,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:27:49,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:27:49,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:27:49,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:27:49,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:27:49,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:27:49,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:27:49,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:27:49,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:27:49,883 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:27:49,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:27:49,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:27:49,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:27:49,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:27:49,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:27:49,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:27:49,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:27:49,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:27:49,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:27:49,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:27:49,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:27:49,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:27:49,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:27:49,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab2e7358ff54d79471e52cc95ead62df9f9f42221b613d220b916398bb7ee282 [2022-02-20 14:27:50,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:27:50,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:27:50,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:27:50,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:27:50,178 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:27:50,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condaf.c [2022-02-20 14:27:50,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5564b7832/e06bc5099c224040a783a9e2bc205b54/FLAGfbf2cde13 [2022-02-20 14:27:50,638 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:27:50,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condaf.c [2022-02-20 14:27:50,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5564b7832/e06bc5099c224040a783a9e2bc205b54/FLAGfbf2cde13 [2022-02-20 14:27:50,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5564b7832/e06bc5099c224040a783a9e2bc205b54 [2022-02-20 14:27:50,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:27:50,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:27:50,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:27:50,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:27:50,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:27:50,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:50,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789bb44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50, skipping insertion in model container [2022-02-20 14:27:50,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:50,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:27:50,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:27:50,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condaf.c[589,602] [2022-02-20 14:27:50,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:27:50,898 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:27:50,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condaf.c[589,602] [2022-02-20 14:27:50,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:27:50,945 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:27:50,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50 WrapperNode [2022-02-20 14:27:50,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:27:50,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:27:50,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:27:50,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:27:50,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:50,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:50,996 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-02-20 14:27:50,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:27:50,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:27:50,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:27:50,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:27:51,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:27:51,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:27:51,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:27:51,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:27:51,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (1/1) ... [2022-02-20 14:27:51,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:27:51,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:51,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:27:51,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:27:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:27:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:27:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:27:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:27:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:27:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:27:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:27:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:27:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:27:51,232 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:27:51,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:27:51,394 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:27:51,398 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:27:51,399 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:27:51,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:51 BoogieIcfgContainer [2022-02-20 14:27:51,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:27:51,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:27:51,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:27:51,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:27:51,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:27:50" (1/3) ... [2022-02-20 14:27:51,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bbdbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:27:51, skipping insertion in model container [2022-02-20 14:27:51,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:27:50" (2/3) ... [2022-02-20 14:27:51,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bbdbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:27:51, skipping insertion in model container [2022-02-20 14:27:51,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:51" (3/3) ... [2022-02-20 14:27:51,406 INFO L111 eAbstractionObserver]: Analyzing ICFG condaf.c [2022-02-20 14:27:51,409 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:27:51,410 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:27:51,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:27:51,454 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:27:51,460 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:27:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-02-20 14:27:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:27:51,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:51,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:51,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-02-20 14:27:51,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:51,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617899057] [2022-02-20 14:27:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:51,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {25#true} is VALID [2022-02-20 14:27:51,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post7#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#1, main_#t~mem14#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {25#true} is VALID [2022-02-20 14:27:51,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25#true} is VALID [2022-02-20 14:27:51,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {26#false} is VALID [2022-02-20 14:27:51,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:27:51,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} assume !(main_~i~0#1 < ~N~0); {26#false} is VALID [2022-02-20 14:27:51,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:27:51,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume !(main_~i~0#1 < ~N~0); {26#false} is VALID [2022-02-20 14:27:51,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:27:51,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume !(main_~i~0#1 < ~N~0); {26#false} is VALID [2022-02-20 14:27:51,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} call main_#t~mem14#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 14:27:51,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 14:27:51,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 14:27:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:51,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:51,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617899057] [2022-02-20 14:27:51,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617899057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:51,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:51,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:27:51,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855993908] [2022-02-20 14:27:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 14:27:51,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:51,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-20 14:27:51,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:51,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:27:51,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:51,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:27:51,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:27:51,763 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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 has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-20 14:27:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:51,809 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-02-20 14:27:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:27:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 14:27:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-20 14:27:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 14:27:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-20 14:27:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 14:27:51,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2022-02-20 14:27:51,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:51,922 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:27:51,935 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:27:51,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:27:51,941 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:51,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:27:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:27:51,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:51,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-02-20 14:27:51,979 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-02-20 14:27:51,984 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-02-20 14:27:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:51,987 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 14:27:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 14:27:51,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:51,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:52,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 18 states. [2022-02-20 14:27:52,001 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 18 states. [2022-02-20 14:27:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:52,007 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 14:27:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 14:27:52,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:52,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:52,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:52,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-02-20 14:27:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 14:27:52,012 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-02-20 14:27:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:52,012 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 14:27:52,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-20 14:27:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 14:27:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:27:52,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:52,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:52,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:27:52,014 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-02-20 14:27:52,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:52,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375866987] [2022-02-20 14:27:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:52,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {134#true} is VALID [2022-02-20 14:27:52,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post7#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#1, main_#t~mem14#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {134#true} is VALID [2022-02-20 14:27:52,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {136#(<= 1 ~N~0)} is VALID [2022-02-20 14:27:52,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {136#(<= 1 ~N~0)} is VALID [2022-02-20 14:27:52,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {137#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:27:52,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {135#false} is VALID [2022-02-20 14:27:52,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {135#false} main_~i~0#1 := 0; {135#false} is VALID [2022-02-20 14:27:52,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {135#false} assume !(main_~i~0#1 < ~N~0); {135#false} is VALID [2022-02-20 14:27:52,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {135#false} main_~i~0#1 := 0; {135#false} is VALID [2022-02-20 14:27:52,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#false} assume !(main_~i~0#1 < ~N~0); {135#false} is VALID [2022-02-20 14:27:52,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#false} call main_#t~mem14#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {135#false} is VALID [2022-02-20 14:27:52,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#false} assume 0 == __VERIFIER_assert_~cond#1; {135#false} is VALID [2022-02-20 14:27:52,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-02-20 14:27:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:27:52,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:52,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375866987] [2022-02-20 14:27:52,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375866987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:27:52,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:27:52,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:27:52,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064628840] [2022-02-20 14:27:52,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:27:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 14:27:52,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:52,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 14:27:52,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:52,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:27:52,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:52,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:27:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:27:52,120 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 14:27:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:52,213 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:27:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:27:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 14:27:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 14:27:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 14:27:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 14:27:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 14:27:52,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 14:27:52,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:52,256 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:27:52,256 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:27:52,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:27:52,258 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:52,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:27:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:27:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-02-20 14:27:52,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:52,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-02-20 14:27:52,266 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-02-20 14:27:52,267 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-02-20 14:27:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:52,268 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 14:27:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 14:27:52,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:52,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:52,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 25 states. [2022-02-20 14:27:52,270 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 25 states. [2022-02-20 14:27:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:52,271 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 14:27:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 14:27:52,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:52,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:52,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:52,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-02-20 14:27:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 14:27:52,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-02-20 14:27:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:52,274 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 14:27:52,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 14:27:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 14:27:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:27:52,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:52,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:52,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:27:52,276 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:52,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-02-20 14:27:52,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:52,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107764897] [2022-02-20 14:27:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:52,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {261#true} is VALID [2022-02-20 14:27:52,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post7#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#1, main_#t~mem14#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {261#true} is VALID [2022-02-20 14:27:52,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {261#true} is VALID [2022-02-20 14:27:52,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} assume !(0 == assume_abort_if_not_~cond#1); {261#true} is VALID [2022-02-20 14:27:52,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {263#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:27:52,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {263#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {264#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:27:52,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {264#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} is VALID [2022-02-20 14:27:52,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} assume !(main_~i~0#1 < ~N~0); {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} is VALID [2022-02-20 14:27:52,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} main_~i~0#1 := 0; {264#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:27:52,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {266#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem8#1| 1))} is VALID [2022-02-20 14:27:52,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem8#1| 1))} assume 0 == main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {262#false} is VALID [2022-02-20 14:27:52,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {262#false} is VALID [2022-02-20 14:27:52,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#false} assume !(main_~i~0#1 < ~N~0); {262#false} is VALID [2022-02-20 14:27:52,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#false} main_~i~0#1 := 0; {262#false} is VALID [2022-02-20 14:27:52,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem12#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {262#false} is VALID [2022-02-20 14:27:52,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {262#false} is VALID [2022-02-20 14:27:52,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#false} assume !(main_~i~0#1 < ~N~0); {262#false} is VALID [2022-02-20 14:27:52,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#false} call main_#t~mem14#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {262#false} is VALID [2022-02-20 14:27:52,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond#1; {262#false} is VALID [2022-02-20 14:27:52,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 14:27:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:27:52,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:27:52,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107764897] [2022-02-20 14:27:52,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107764897] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:52,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65121795] [2022-02-20 14:27:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:52,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:27:52,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:27:52,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:27:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:52,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 14:27:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:27:52,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:27:52,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 14:27:52,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 14:27:52,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {261#true} is VALID [2022-02-20 14:27:52,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post7#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#1, main_#t~mem14#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {261#true} is VALID [2022-02-20 14:27:52,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {261#true} is VALID [2022-02-20 14:27:52,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} assume !(0 == assume_abort_if_not_~cond#1); {261#true} is VALID [2022-02-20 14:27:52,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {263#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:27:52,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {263#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} is VALID [2022-02-20 14:27:52,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} is VALID [2022-02-20 14:27:52,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} assume !(main_~i~0#1 < ~N~0); {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} is VALID [2022-02-20 14:27:52,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1))} main_~i~0#1 := 0; {264#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:27:52,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {297#(= |ULTIMATE.start_main_#t~mem8#1| 1)} is VALID [2022-02-20 14:27:52,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {297#(= |ULTIMATE.start_main_#t~mem8#1| 1)} assume 0 == main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {262#false} is VALID [2022-02-20 14:27:52,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {262#false} is VALID [2022-02-20 14:27:52,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#false} assume !(main_~i~0#1 < ~N~0); {262#false} is VALID [2022-02-20 14:27:52,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#false} main_~i~0#1 := 0; {262#false} is VALID [2022-02-20 14:27:52,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem12#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {262#false} is VALID [2022-02-20 14:27:52,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {262#false} is VALID [2022-02-20 14:27:52,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#false} assume !(main_~i~0#1 < ~N~0); {262#false} is VALID [2022-02-20 14:27:52,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#false} call main_#t~mem14#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {262#false} is VALID [2022-02-20 14:27:52,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond#1; {262#false} is VALID [2022-02-20 14:27:52,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 14:27:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:27:52,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:52,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-02-20 14:27:52,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-02-20 14:27:52,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 14:27:52,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#false} assume 0 == __VERIFIER_assert_~cond#1; {262#false} is VALID [2022-02-20 14:27:52,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#false} call main_#t~mem14#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 2 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {262#false} is VALID [2022-02-20 14:27:52,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#false} assume !(main_~i~0#1 < ~N~0); {262#false} is VALID [2022-02-20 14:27:52,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {262#false} is VALID [2022-02-20 14:27:52,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem12#1 := read~int(main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; {262#false} is VALID [2022-02-20 14:27:52,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#false} main_~i~0#1 := 0; {262#false} is VALID [2022-02-20 14:27:52,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#false} assume !(main_~i~0#1 < ~N~0); {262#false} is VALID [2022-02-20 14:27:52,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {262#false} is VALID [2022-02-20 14:27:52,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(not (= |ULTIMATE.start_main_#t~mem8#1| 0))} assume 0 == main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {262#false} is VALID [2022-02-20 14:27:52,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {355#(not (= |ULTIMATE.start_main_#t~mem8#1| 0))} is VALID [2022-02-20 14:27:52,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 0))} main_~i~0#1 := 0; {359#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-20 14:27:52,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 0))} assume !(main_~i~0#1 < ~N~0); {363#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 0))} is VALID [2022-02-20 14:27:52,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {363#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 0))} is VALID [2022-02-20 14:27:52,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {373#(= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))} assume !!(main_~i~0#1 < ~N~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {363#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 0))} is VALID [2022-02-20 14:27:52,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {373#(= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-20 14:27:52,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} assume !(0 == assume_abort_if_not_~cond#1); {261#true} is VALID [2022-02-20 14:27:52,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {261#true} is VALID [2022-02-20 14:27:52,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post7#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#1, main_#t~mem14#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {261#true} is VALID [2022-02-20 14:27:52,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {261#true} is VALID [2022-02-20 14:27:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:27:52,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65121795] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:27:52,851 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:27:52,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-20 14:27:52,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069322732] [2022-02-20 14:27:52,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) Word has length 20 [2022-02-20 14:27:52,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:52,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-02-20 14:27:52,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:52,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:27:52,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:27:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:27:52,878 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-02-20 14:27:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:53,073 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-02-20 14:27:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:27:53,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) Word has length 20 [2022-02-20 14:27:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-02-20 14:27:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 14:27:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-02-20 14:27:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 14:27:53,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 14:27:53,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:53,110 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:27:53,111 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:27:53,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:27:53,112 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:53,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:27:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:27:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-02-20 14:27:53,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:53,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-02-20 14:27:53,118 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-02-20 14:27:53,119 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-02-20 14:27:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:53,120 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 14:27:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 14:27:53,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:53,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:53,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 25 states. [2022-02-20 14:27:53,121 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 25 states. [2022-02-20 14:27:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:53,122 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 14:27:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 14:27:53,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:53,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:53,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:53,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-02-20 14:27:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 14:27:53,123 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2022-02-20 14:27:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:53,124 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 14:27:53,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-02-20 14:27:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:27:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:27:53,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:53,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:53,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:27:53,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:53,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-02-20 14:27:53,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:53,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420405395] [2022-02-20 14:27:53,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:27:53,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:27:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:27:53,446 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:27:53,447 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:27:53,449 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:27:53,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:27:53,453 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 14:27:53,465 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:27:53,489 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:27:53,489 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:27:53,489 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:27:53,490 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-02-20 14:27:53,491 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-02-20 14:27:53,495 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-02-20 14:27:53,495 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 14:27:53,495 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 14:27:53,495 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 14:27:53,496 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:27:53,496 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:27:53,496 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:27:53,496 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:27:53,496 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 14:27:53,496 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:27:53,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:27:53 BoogieIcfgContainer [2022-02-20 14:27:53,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:27:53,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:27:53,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:27:53,497 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:27:53,498 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:27:51" (3/4) ... [2022-02-20 14:27:53,499 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:27:53,540 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:27:53,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:27:53,541 INFO L158 Benchmark]: Toolchain (without parser) took 2883.25ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 98.3MB in the beginning and 94.7MB in the end (delta: 3.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,541 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:27:53,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.83ms. Allocated memory is still 125.8MB. Free memory was 98.0MB in the beginning and 98.8MB in the end (delta: -782.5kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.67ms. Allocated memory is still 125.8MB. Free memory was 98.5MB in the beginning and 96.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,542 INFO L158 Benchmark]: Boogie Preprocessor took 47.09ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 95.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,542 INFO L158 Benchmark]: RCFGBuilder took 354.69ms. Allocated memory is still 125.8MB. Free memory was 95.2MB in the beginning and 82.6MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,542 INFO L158 Benchmark]: TraceAbstraction took 2095.71ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 82.3MB in the beginning and 97.8MB in the end (delta: -15.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,543 INFO L158 Benchmark]: Witness Printer took 42.84ms. Allocated memory is still 151.0MB. Free memory was 97.8MB in the beginning and 94.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:27:53,544 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.19ms. Allocated memory is still 125.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.83ms. Allocated memory is still 125.8MB. Free memory was 98.0MB in the beginning and 98.8MB in the end (delta: -782.5kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.67ms. Allocated memory is still 125.8MB. Free memory was 98.5MB in the beginning and 96.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.09ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 95.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.69ms. Allocated memory is still 125.8MB. Free memory was 95.2MB in the beginning and 82.6MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2095.71ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 82.3MB in the beginning and 97.8MB in the end (delta: -15.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Witness Printer took 42.84ms. Allocated memory is still 151.0MB. Free memory was 97.8MB in the beginning and 94.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] int sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 0 [L32] i=0 VAL [a={-2:0}, i=0, N=1, sum={5:0}] [L32] COND TRUE i