/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum_array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:01:32,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:01:32,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:01:32,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:01:32,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:01:32,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:01:32,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:01:32,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:01:32,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:01:32,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:01:32,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:01:32,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:01:32,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:01:32,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:01:32,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:01:32,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:01:32,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:01:32,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:01:32,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:01:32,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:01:32,421 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:01:32,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:01:32,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:01:32,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:01:32,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:01:32,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:01:32,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:01:32,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:01:32,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:01:32,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:01:32,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:01:32,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:01:32,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:01:32,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:01:32,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:01:32,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:01:32,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:01:32,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:01:32,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:01:32,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:01:32,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:01:32,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:01:32,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:01:32,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:01:32,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:01:32,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:01:32,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:01:32,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:01:32,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:01:32,463 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:01:32,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:01:32,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:01:32,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:01:32,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:32,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:01:32,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:01:32,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:01:32,466 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:01:32,466 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:01:32,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:01:32,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:01:32,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:01:32,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:01:32,627 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:01:32,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-1.c [2022-04-07 22:01:32,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22fe8df3b/5a23488a895d4d8c88fa8b67308bec94/FLAG9bef9cbc4 [2022-04-07 22:01:33,034 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:01:33,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-1.c [2022-04-07 22:01:33,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22fe8df3b/5a23488a895d4d8c88fa8b67308bec94/FLAG9bef9cbc4 [2022-04-07 22:01:33,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22fe8df3b/5a23488a895d4d8c88fa8b67308bec94 [2022-04-07 22:01:33,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:01:33,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:01:33,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:33,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:01:33,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:01:33,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a56c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33, skipping insertion in model container [2022-04-07 22:01:33,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:01:33,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:01:33,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-1.c[363,376] [2022-04-07 22:01:33,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:33,717 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:01:33,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-1.c[363,376] [2022-04-07 22:01:33,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:33,739 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:01:33,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33 WrapperNode [2022-04-07 22:01:33,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:33,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:01:33,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:01:33,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:01:33,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:01:33,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:01:33,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:01:33,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:01:33,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (1/1) ... [2022-04-07 22:01:33,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:33,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:01:33,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:01:33,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:01:33,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:01:33,852 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:01:33,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:01:33,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:01:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:01:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:01:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:01:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:01:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:01:33,901 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:01:33,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:01:34,044 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:01:34,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:01:34,048 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-07 22:01:34,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:34 BoogieIcfgContainer [2022-04-07 22:01:34,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:01:34,050 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:01:34,050 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:01:34,051 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:01:34,053 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:34" (1/1) ... [2022-04-07 22:01:34,054 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:01:34,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:34 BasicIcfg [2022-04-07 22:01:34,076 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:01:34,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:01:34,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:01:34,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:01:34,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:01:33" (1/4) ... [2022-04-07 22:01:34,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1359911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:34, skipping insertion in model container [2022-04-07 22:01:34,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:33" (2/4) ... [2022-04-07 22:01:34,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1359911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:34, skipping insertion in model container [2022-04-07 22:01:34,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:34" (3/4) ... [2022-04-07 22:01:34,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1359911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:34, skipping insertion in model container [2022-04-07 22:01:34,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:34" (4/4) ... [2022-04-07 22:01:34,081 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-1.cqvasr [2022-04-07 22:01:34,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:01:34,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:01:34,109 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:01:34,114 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:01:34,114 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:01:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 22:01:34,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:34,129 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:34,129 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash -369292380, now seen corresponding path program 1 times [2022-04-07 22:01:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:34,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652946205] [2022-04-07 22:01:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-07 22:01:34,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:01:34,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:01:34,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:34,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-07 22:01:34,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:01:34,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:01:34,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:01:34,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [88] mainENTRY-->L20-3: Formula: (let ((.cse2 (store |v_#valid_4| |v_main_~#A~0.base_1| 1))) (let ((.cse0 (store .cse2 |v_main_~#B~0.base_1| 1))) (and (= 0 |v_main_~#A~0.offset_1|) (= (select .cse0 |v_main_~#C~0.base_1|) 0) (= v_main_~i~0_1 0) (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_1|) (not (= |v_main_~#C~0.base_1| 0)) (= v_main_~M~0_1 |v_main_#t~nondet4_2|) (= |v_main_~#C~0.offset_1| 0) (= (let ((.cse1 (* (mod v_main_~M~0_1 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_1| .cse1) |v_main_~#B~0.base_1| .cse1) |v_main_~#C~0.base_1| .cse1)) |v_#length_1|) (= (select |v_#valid_4| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (not (= |v_main_~#B~0.base_1| 0)) (= (store .cse0 |v_main_~#C~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_1|) (= 0 |v_main_~#B~0.offset_1|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= (select .cse2 |v_main_~#B~0.base_1|) 0)))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_1, main_~M~0=v_main_~M~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_~#B~0.offset, main_#t~nondet4, main_~#C~0.offset, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {33#true} is VALID [2022-04-07 22:01:34,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} [90] L20-3-->L20-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:01:34,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} [93] L20-4-->L23-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {34#false} is VALID [2022-04-07 22:01:34,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} [96] L23-3-->L23-4: Formula: (not (< (mod v_main_~i~0_15 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:01:34,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [98] L23-4-->L26-3: Formula: (= v_main_~i~0_21 0) InVars {} OutVars{main_~i~0=v_main_~i~0_21} AuxVars[] AssignedVars[main_~i~0] {34#false} is VALID [2022-04-07 22:01:34,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} [100] L26-3-->L26-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:01:34,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} [103] L26-4-->L29-3: Formula: (= v_main_~i~0_11 0) InVars {} OutVars{main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_~i~0] {34#false} is VALID [2022-04-07 22:01:34,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [107] L29-3-->L30: Formula: (let ((.cse0 (mod v_main_~i~0_14 4294967296))) (let ((.cse1 (* .cse0 4))) (and (< .cse0 (mod v_main_~M~0_7 4294967296)) (= |v_main_#t~mem13_1| (select (select |v_#memory_int_5| |v_main_~#A~0.base_4|) (+ .cse1 |v_main_~#A~0.offset_4|))) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_5| |v_main_~#B~0.base_3|) (+ .cse1 |v_main_~#B~0.offset_3|))) (= (select (select |v_#memory_int_5| |v_main_~#C~0.base_3|) (+ |v_main_~#C~0.offset_3| .cse1)) |v_main_#t~mem15_1|)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#C~0.base=|v_main_~#C~0.base_3|} OutVars{main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_#t~mem15=|v_main_#t~mem15_1|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~#C~0.base=|v_main_~#C~0.base_3|} AuxVars[] AssignedVars[main_#t~mem13, main_#t~mem14, main_#t~mem15] {34#false} is VALID [2022-04-07 22:01:34,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {34#false} [109] L30-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ |v_main_#t~mem13_4| (* (- 1) |v_main_#t~mem14_4|)) |v_main_#t~mem15_4|) 1 0)) InVars {main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|, main_#t~mem15=|v_main_#t~mem15_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14, main_#t~mem15] {34#false} is VALID [2022-04-07 22:01:34,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-07 22:01:34,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [114] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:01:34,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [116] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:01:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:34,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:34,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652946205] [2022-04-07 22:01:34,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652946205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:34,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:34,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:01:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364152194] [2022-04-07 22:01:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 22:01:34,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:34,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:34,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:34,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:01:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:01:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:01:34,417 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:34,511 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-07 22:01:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:01:34,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 22:01:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-04-07 22:01:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-04-07 22:01:34,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-04-07 22:01:34,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:34,585 INFO L225 Difference]: With dead ends: 52 [2022-04-07 22:01:34,585 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 22:01:34,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:01:34,589 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:34,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 22:01:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-07 22:01:34,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:34,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:34,609 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:34,609 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:34,612 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-07 22:01:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 22:01:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:34,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-07 22:01:34,613 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-07 22:01:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:34,615 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-07 22:01:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 22:01:34,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:34,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:34,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:34,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-07 22:01:34,618 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-07 22:01:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:34,619 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-07 22:01:34,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 22:01:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 22:01:34,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:34,620 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:34,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:01:34,620 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1278740058, now seen corresponding path program 1 times [2022-04-07 22:01:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:34,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601758922] [2022-04-07 22:01:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:34,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193#true} is VALID [2022-04-07 22:01:34,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-07 22:01:34,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-07 22:01:34,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:34,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193#true} is VALID [2022-04-07 22:01:34,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-07 22:01:34,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-07 22:01:34,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {193#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-07 22:01:34,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#true} [88] mainENTRY-->L20-3: Formula: (let ((.cse2 (store |v_#valid_4| |v_main_~#A~0.base_1| 1))) (let ((.cse0 (store .cse2 |v_main_~#B~0.base_1| 1))) (and (= 0 |v_main_~#A~0.offset_1|) (= (select .cse0 |v_main_~#C~0.base_1|) 0) (= v_main_~i~0_1 0) (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_1|) (not (= |v_main_~#C~0.base_1| 0)) (= v_main_~M~0_1 |v_main_#t~nondet4_2|) (= |v_main_~#C~0.offset_1| 0) (= (let ((.cse1 (* (mod v_main_~M~0_1 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_1| .cse1) |v_main_~#B~0.base_1| .cse1) |v_main_~#C~0.base_1| .cse1)) |v_#length_1|) (= (select |v_#valid_4| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (not (= |v_main_~#B~0.base_1| 0)) (= (store .cse0 |v_main_~#C~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_1|) (= 0 |v_main_~#B~0.offset_1|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= (select .cse2 |v_main_~#B~0.base_1|) 0)))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_1, main_~M~0=v_main_~M~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_~#B~0.offset, main_#t~nondet4, main_~#C~0.offset, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {198#(= main_~i~0 0)} is VALID [2022-04-07 22:01:34,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(= main_~i~0 0)} [91] L20-3-->L20-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_5, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-07 22:01:34,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [93] L20-4-->L23-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-07 22:01:34,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [96] L23-3-->L23-4: Formula: (not (< (mod v_main_~i~0_15 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-07 22:01:34,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [98] L23-4-->L26-3: Formula: (= v_main_~i~0_21 0) InVars {} OutVars{main_~i~0=v_main_~i~0_21} AuxVars[] AssignedVars[main_~i~0] {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-07 22:01:34,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [101] L26-3-->L26-4: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~M~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~M~0=v_main_~M~0_2} OutVars{main_~i~0=v_main_~i~0_3, main_~M~0=v_main_~M~0_2} AuxVars[] AssignedVars[] {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-07 22:01:34,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [103] L26-4-->L29-3: Formula: (= v_main_~i~0_11 0) InVars {} OutVars{main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_~i~0] {200#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-07 22:01:34,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {200#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} [107] L29-3-->L30: Formula: (let ((.cse0 (mod v_main_~i~0_14 4294967296))) (let ((.cse1 (* .cse0 4))) (and (< .cse0 (mod v_main_~M~0_7 4294967296)) (= |v_main_#t~mem13_1| (select (select |v_#memory_int_5| |v_main_~#A~0.base_4|) (+ .cse1 |v_main_~#A~0.offset_4|))) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_5| |v_main_~#B~0.base_3|) (+ .cse1 |v_main_~#B~0.offset_3|))) (= (select (select |v_#memory_int_5| |v_main_~#C~0.base_3|) (+ |v_main_~#C~0.offset_3| .cse1)) |v_main_#t~mem15_1|)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#C~0.base=|v_main_~#C~0.base_3|} OutVars{main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_#t~mem15=|v_main_#t~mem15_1|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~#C~0.base=|v_main_~#C~0.base_3|} AuxVars[] AssignedVars[main_#t~mem13, main_#t~mem14, main_#t~mem15] {194#false} is VALID [2022-04-07 22:01:34,760 INFO L272 TraceCheckUtils]: 13: Hoare triple {194#false} [109] L30-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ |v_main_#t~mem13_4| (* (- 1) |v_main_#t~mem14_4|)) |v_main_#t~mem15_4|) 1 0)) InVars {main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|, main_#t~mem15=|v_main_#t~mem15_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14, main_#t~mem15] {194#false} is VALID [2022-04-07 22:01:34,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {194#false} is VALID [2022-04-07 22:01:34,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {194#false} [114] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-07 22:01:34,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {194#false} [116] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-07 22:01:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:34,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601758922] [2022-04-07 22:01:34,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601758922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:34,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:34,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 22:01:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348376825] [2022-04-07 22:01:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:34,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 22:01:34,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:34,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:34,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:34,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 22:01:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 22:01:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 22:01:34,777 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:35,003 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-07 22:01:35,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 22:01:35,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 22:01:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 22:01:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 22:01:35,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-07 22:01:35,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:35,064 INFO L225 Difference]: With dead ends: 57 [2022-04-07 22:01:35,064 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 22:01:35,064 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-07 22:01:35,065 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:35,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 33 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:01:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 22:01:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-07 22:01:35,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:35,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:35,070 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:35,070 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:35,073 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-07 22:01:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-07 22:01:35,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:35,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:35,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-07 22:01:35,074 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-07 22:01:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:35,075 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-07 22:01:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-07 22:01:35,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:35,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:35,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:35,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:01:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-07 22:01:35,077 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2022-04-07 22:01:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:35,078 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-07 22:01:35,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-07 22:01:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 22:01:35,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:35,078 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:35,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:01:35,079 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -869806592, now seen corresponding path program 1 times [2022-04-07 22:01:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151763981] [2022-04-07 22:01:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 22:01:35,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 22:01:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 22:01:35,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 22:01:35,161 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 22:01:35,162 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:01:35,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 22:01:35,165 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 22:01:35,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:01:35,184 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 22:01:35,184 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 22:01:35,184 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 22:01:35,184 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 22:01:35,184 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:01:35,185 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:01:35,186 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:01:35,186 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-04-07 22:01:35,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:35 BasicIcfg [2022-04-07 22:01:35,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:01:35,188 INFO L158 Benchmark]: Toolchain (without parser) took 1696.45ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 97.5MB in the end (delta: 22.2MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2022-04-07 22:01:35,188 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:01:35,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.63ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 146.4MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 22:01:35,189 INFO L158 Benchmark]: Boogie Preprocessor took 22.13ms. Allocated memory is still 167.8MB. Free memory was 146.4MB in the beginning and 144.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:01:35,189 INFO L158 Benchmark]: RCFGBuilder took 285.10ms. Allocated memory is still 167.8MB. Free memory was 144.9MB in the beginning and 131.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 22:01:35,189 INFO L158 Benchmark]: IcfgTransformer took 26.24ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 129.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:01:35,189 INFO L158 Benchmark]: TraceAbstraction took 1109.65ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 97.5MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-04-07 22:01:35,191 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.09ms. Allocated memory is still 167.8MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.63ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 146.4MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.13ms. Allocated memory is still 167.8MB. Free memory was 146.4MB in the beginning and 144.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 285.10ms. Allocated memory is still 167.8MB. Free memory was 144.9MB in the beginning and 131.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 26.24ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 129.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1109.65ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 97.5MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int M = __VERIFIER_nondet_uint(); [L17] int A[M], B[M], C[M]; [L18] unsigned int i; [L20] i=0 VAL [A={6:0}, B={5:0}, C={7:0}, i=0, M=1] [L20] COND TRUE i