/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/loop-crafted/simple_array_index_value_1-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:32:52,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:32:52,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:32:52,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:32:52,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:32:52,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:32:52,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:32:52,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:32:52,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:32:52,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:32:52,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:32:52,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:32:52,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:32:52,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:32:52,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:32:52,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:32:52,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:32:52,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:32:52,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:32:52,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:32:52,722 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:32:52,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:32:52,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:32:52,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:32:52,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:32:52,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:32:52,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:32:52,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:32:52,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:32:52,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:32:52,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:32:52,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:32:52,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:32:52,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:32:52,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:32:52,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:32:52,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:32:52,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:32:52,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:32:52,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:32:52,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:32:52,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:32:52,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:32:52,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:32:52,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:32:52,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:32:52,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:32:52,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:32:52,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:32:52,772 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:32:52,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:32:52,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:32:52,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:32:52,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:32:52,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:32:52,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:32:52,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:32:52,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:32:52,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:32:52,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:32:52,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:32:52,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:32:52,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:32:52,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:32:52,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:32:52,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:32:52,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:32:52,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:32:52,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:32:52,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:32:52,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:32:52,777 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:32:52,777 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-27 21:32:52,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:32:53,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:32:53,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:32:53,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:32:53,006 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:32:53,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-2.i [2022-04-27 21:32:53,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f60807c/1d562e8c31a9416c984d9945c2811496/FLAG84841cfac [2022-04-27 21:32:53,515 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:32:53,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-2.i [2022-04-27 21:32:53,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f60807c/1d562e8c31a9416c984d9945c2811496/FLAG84841cfac [2022-04-27 21:32:53,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f60807c/1d562e8c31a9416c984d9945c2811496 [2022-04-27 21:32:53,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:32:53,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:32:53,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:32:53,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:32:53,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:32:53,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:32:53" (1/1) ... [2022-04-27 21:32:53,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368061f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:53, skipping insertion in model container [2022-04-27 21:32:53,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:32:53" (1/1) ... [2022-04-27 21:32:53,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:32:53,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:32:54,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-2.i[921,934] [2022-04-27 21:32:54,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:32:54,108 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:32:54,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-2.i[921,934] [2022-04-27 21:32:54,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:32:54,163 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:32:54,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54 WrapperNode [2022-04-27 21:32:54,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:32:54,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:32:54,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:32:54,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:32:54,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:32:54,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:32:54,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:32:54,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:32:54,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:32:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:32:54,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:32:54,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:32:54,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:32:54,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:32:54,291 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:32:54,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:32:54,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:32:54,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:32:54,292 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:32:54,292 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:32:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:32:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:32:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:32:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:32:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:32:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:32:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:32:54,371 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:32:54,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:32:54,522 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:32:54,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:32:54,534 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:32:54,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:32:54 BoogieIcfgContainer [2022-04-27 21:32:54,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:32:54,537 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:32:54,537 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:32:54,564 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:32:54,567 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:32:54" (1/1) ... [2022-04-27 21:32:54,569 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:32:54,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:32:54 BasicIcfg [2022-04-27 21:32:54,591 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:32:54,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:32:54,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:32:54,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:32:54,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:32:53" (1/4) ... [2022-04-27 21:32:54,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ebb9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:32:54, skipping insertion in model container [2022-04-27 21:32:54,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:54" (2/4) ... [2022-04-27 21:32:54,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ebb9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:32:54, skipping insertion in model container [2022-04-27 21:32:54,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:32:54" (3/4) ... [2022-04-27 21:32:54,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ebb9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:32:54, skipping insertion in model container [2022-04-27 21:32:54,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:32:54" (4/4) ... [2022-04-27 21:32:54,598 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-2.iqvasr [2022-04-27 21:32:54,632 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:32:54,632 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:32:54,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:32:54,693 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5396028c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d71184c [2022-04-27 21:32:54,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:32:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:32:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:32:54,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:32:54,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:32:54,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:32:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:32:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1941867370, now seen corresponding path program 1 times [2022-04-27 21:32:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:32:54,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332813622] [2022-04-27 21:32:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:32:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:32:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:32:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:32:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:32:54,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 21:32:54,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:32:54,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:32:54,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:32:54,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 21:32:54,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:32:54,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:32:54,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:32:54,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [69] mainENTRY-->L39-2: Formula: (and (= |v_main_~#array~0.offset_5| 0) (= (store |v_#valid_4| |v_main_~#array~0.base_5| 1) |v_#valid_3|) (= v_main_~index~0_4 0) (not (= |v_main_~#array~0.base_5| 0)) (= (select |v_#valid_4| |v_main_~#array~0.base_5|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_5|) (= (store |v_#length_2| |v_main_~#array~0.base_5| 40000) |v_#length_1|) (= v_main_~tmp~0_4 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{main_~tmp~0=v_main_~tmp~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_4, main_~#array~0.base=|v_main_~#array~0.base_5|, #valid=|v_#valid_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {25#true} is VALID [2022-04-27 21:32:54,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [71] L39-2-->L39-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:32:54,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [74] L39-3-->L48: Formula: (let ((.cse0 (< (mod v_main_~tmp~0_1 4294967296) 10000))) (or (and (not .cse0) (not |v_main_#t~short3_1|)) (and |v_main_#t~short3_1| .cse0))) InVars {main_~tmp~0=v_main_~tmp~0_1} OutVars{main_#t~short3=|v_main_#t~short3_1|, main_~tmp~0=v_main_~tmp~0_1} AuxVars[] AssignedVars[main_#t~short3] {26#false} is VALID [2022-04-27 21:32:54,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [77] L48-->L48-2: Formula: (let ((.cse0 (mod v_main_~tmp~0_2 4294967296))) (and |v_main_#t~short3_3| (= |v_main_#t~mem2_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse0 4) |v_main_~#array~0.offset_1|))) (let ((.cse1 (= (mod |v_main_#t~mem2_1| 4294967296) .cse0))) (or (and (not .cse1) (not |v_main_#t~short3_2|)) (and |v_main_#t~short3_2| .cse1))))) InVars {#memory_int=|v_#memory_int_1|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_#t~short3=|v_main_#t~short3_3|} OutVars{main_~tmp~0=v_main_~tmp~0_2, main_#t~short3=|v_main_#t~short3_2|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_#t~mem2=|v_main_#t~mem2_1|, #memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|} AuxVars[] AssignedVars[main_#t~short3, main_#t~mem2] {26#false} is VALID [2022-04-27 21:32:54,969 INFO L272 TraceCheckUtils]: 9: Hoare triple {26#false} [79] L48-2-->__VERIFIER_assertENTRY: Formula: (= (ite |v_main_#t~short3_7| 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~short3=|v_main_#t~short3_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short3] {26#false} is VALID [2022-04-27 21:32:54,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [81] __VERIFIER_assertENTRY-->L25: 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] {26#false} is VALID [2022-04-27 21:32:54,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [83] L25-->L26: 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[] {26#false} is VALID [2022-04-27 21:32:54,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [85] L26-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:32:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:32:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:32:54,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332813622] [2022-04-27 21:32:54,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332813622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:32:54,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:32:54,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:32:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793678932] [2022-04-27 21:32:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:32:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 21:32:54,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:32:54,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:32:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:32:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:32:55,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:32:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:32:55,057 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:32:55,162 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-27 21:32:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:32:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 21:32:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:32:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 21:32:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 21:32:55,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-27 21:32:55,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:32:55,270 INFO L225 Difference]: With dead ends: 36 [2022-04-27 21:32:55,271 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:32:55,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:32:55,276 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:32:55,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:32:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:32:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:32:55,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:32:55,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,306 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,307 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:32:55,309 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:32:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:32:55,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:32:55,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:32:55,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-27 21:32:55,314 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-27 21:32:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:32:55,316 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:32:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:32:55,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:32:55,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:32:55,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:32:55,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:32:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 21:32:55,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2022-04-27 21:32:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:32:55,323 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 21:32:55,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:32:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:32:55,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:32:55,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:32:55,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:32:55,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:32:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:32:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -77985247, now seen corresponding path program 1 times [2022-04-27 21:32:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:32:55,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943222780] [2022-04-27 21:32:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:32:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:32:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 21:32:55,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 21:32:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 21:32:55,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 21:32:55,392 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 21:32:55,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:32:55,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:32:55,398 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 21:32:55,401 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:32:55,420 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:32:55,421 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:32:55,422 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:32:55,423 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:32:55,423 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-27 21:32:55,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:32:55 BasicIcfg [2022-04-27 21:32:55,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:32:55,425 INFO L158 Benchmark]: Toolchain (without parser) took 1506.80ms. Allocated memory is still 174.1MB. Free memory was 123.1MB in the beginning and 97.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-04-27 21:32:55,425 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory was 139.5MB in the beginning and 139.4MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:32:55,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.94ms. Allocated memory is still 174.1MB. Free memory was 122.8MB in the beginning and 150.1MB in the end (delta: -27.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 21:32:55,426 INFO L158 Benchmark]: Boogie Preprocessor took 50.59ms. Allocated memory is still 174.1MB. Free memory was 150.1MB in the beginning and 148.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:32:55,427 INFO L158 Benchmark]: RCFGBuilder took 319.97ms. Allocated memory is still 174.1MB. Free memory was 148.4MB in the beginning and 137.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:32:55,428 INFO L158 Benchmark]: IcfgTransformer took 54.32ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 136.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:32:55,429 INFO L158 Benchmark]: TraceAbstraction took 830.94ms. Allocated memory is still 174.1MB. Free memory was 135.8MB in the beginning and 97.3MB in the end (delta: 38.5MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-04-27 21:32:55,431 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.12ms. Allocated memory is still 174.1MB. Free memory was 139.5MB in the beginning and 139.4MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.94ms. Allocated memory is still 174.1MB. Free memory was 122.8MB in the beginning and 150.1MB in the end (delta: -27.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.59ms. Allocated memory is still 174.1MB. Free memory was 150.1MB in the beginning and 148.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 319.97ms. Allocated memory is still 174.1MB. Free memory was 148.4MB in the beginning and 137.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 54.32ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 136.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 830.94ms. Allocated memory is still 174.1MB. Free memory was 135.8MB in the beginning and 97.3MB in the end (delta: 38.5MB). Peak memory consumption was 38.8MB. 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: 26]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L35] unsigned int array[10000]; [L36] unsigned int index = 0; [L37] unsigned int tmp = 0; VAL [array={3:0}, index=0, tmp=0] [L39] COND TRUE 1 [L40] index = __VERIFIER_nondet_uint() [L41] COND TRUE index >= 10000 VAL [array={3:0}, index=10000, tmp=0] [L48] EXPR tmp < 10000 && array[tmp] == tmp [L48] EXPR array[tmp] [L48] EXPR tmp < 10000 && array[tmp] == tmp VAL [array={3:0}, array[tmp]=4, index=10000, tmp=0, tmp < 10000 && array[tmp] == tmp=0] [L48] CALL __VERIFIER_assert(tmp < 10000 && array[tmp] == tmp) VAL [\old(cond)=0] [L25] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L26] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 22 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 21:32:55,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...