/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_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:26:52,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:26:52,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:26:52,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:26:52,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:26:52,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:26:52,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:26:52,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:26:52,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:26:52,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:26:52,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:26:52,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:26:52,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:26:52,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:26:52,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:26:52,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:26:52,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:26:52,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:26:52,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:26:52,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:26:52,955 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:26:52,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:26:52,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:26:52,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:26:52,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:26:52,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:26:52,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:26:52,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:26:52,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:26:52,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:26:52,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:26:52,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:26:52,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:26:52,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:26:52,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:26:52,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:26:52,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:26:52,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:26:52,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:26:52,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:26:52,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:26:52,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:26:52,972 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:26:53,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:26:53,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:26:53,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:26:53,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:26:53,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:26:53,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:26:53,003 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:26:53,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:26:53,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:26:53,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:26:53,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:26:53,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:26:53,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:26:53,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:26:53,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:26:53,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:26:53,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:26:53,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:26:53,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:26:53,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:26:53,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:26:53,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:26:53,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:26:53,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:26:53,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:26:53,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:26:53,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:26:53,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:26:53,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:26:53,007 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:26:53,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:26:53,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:26:53,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:26:53,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:26:53,298 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:26:53,299 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_2.i [2022-04-07 22:26:53,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fb02a17/aa4857adb33a4baabf7a27a033101f84/FLAGbf4ede8c4 [2022-04-07 22:26:53,762 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:26:53,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2022-04-07 22:26:53,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fb02a17/aa4857adb33a4baabf7a27a033101f84/FLAGbf4ede8c4 [2022-04-07 22:26:53,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fb02a17/aa4857adb33a4baabf7a27a033101f84 [2022-04-07 22:26:53,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:26:53,787 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:26:53,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:26:53,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:26:53,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:26:53,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:26:53" (1/1) ... [2022-04-07 22:26:53,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e304f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:53, skipping insertion in model container [2022-04-07 22:26:53,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:26:53" (1/1) ... [2022-04-07 22:26:53,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:26:53,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:26:54,030 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_2.i[919,932] [2022-04-07 22:26:54,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:26:54,064 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:26:54,078 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_2.i[919,932] [2022-04-07 22:26:54,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:26:54,098 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:26:54,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54 WrapperNode [2022-04-07 22:26:54,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:26:54,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:26:54,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:26:54,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:26:54,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:26:54,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:26:54,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:26:54,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:26:54,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:26:54,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:26:54,180 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:26:54,196 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:26:54,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:26:54,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:26:54,226 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:26:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:26:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:26:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:26:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:26:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:26:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:26:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:26:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:26:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:26:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:26:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:26:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 22:26:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:26:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 22:26:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:26:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:26:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:26:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:26:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:26:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:26:54,293 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:26:54,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:26:54,552 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:26:54,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:26:54,559 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 22:26:54,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:26:54 BoogieIcfgContainer [2022-04-07 22:26:54,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:26:54,561 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:26:54,561 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:26:54,568 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:26:54,571 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:26:54" (1/1) ... [2022-04-07 22:26:54,573 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:26:54,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:26:54 BasicIcfg [2022-04-07 22:26:54,613 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:26:54,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:26:54,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:26:54,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:26:54,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:26:53" (1/4) ... [2022-04-07 22:26:54,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db4c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:26:54, skipping insertion in model container [2022-04-07 22:26:54,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:26:54" (2/4) ... [2022-04-07 22:26:54,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db4c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:26:54, skipping insertion in model container [2022-04-07 22:26:54,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:26:54" (3/4) ... [2022-04-07 22:26:54,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db4c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:26:54, skipping insertion in model container [2022-04-07 22:26:54,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:26:54" (4/4) ... [2022-04-07 22:26:54,625 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.iqvasr [2022-04-07 22:26:54,630 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:26:54,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:26:54,679 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:26:54,687 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:26:54,687 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:26:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:26:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 22:26:54,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:26:54,709 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:26:54,710 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:26:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:26:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -183287108, now seen corresponding path program 1 times [2022-04-07 22:26:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:26:54,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279494627] [2022-04-07 22:26:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:26:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:26:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:26:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:54,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [75] 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) (= 29 (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] {33#true} is VALID [2022-04-07 22:26:54,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [78] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:26:54,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [104] 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:26:54,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [73] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:26:54,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [75] 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) (= 29 (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] {33#true} is VALID [2022-04-07 22:26:54,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [78] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:26:54,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [104] 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:26:54,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [74] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:26:54,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [77] mainENTRY-->L38-3: Formula: (and (not (= |v_main_~#array~0.base_2| 0)) (= (store |v_#length_2| |v_main_~#array~0.base_2| 40000) |v_#length_1|) (= |v_main_~#array~0.offset_2| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_2| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_2|) 0) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_2|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {38#(= main_~index~0 0)} is VALID [2022-04-07 22:26:54,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#(= main_~index~0 0)} [80] L38-3-->L38-4: Formula: (not (< (mod v_main_~index~0_8 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_8} OutVars{main_~index~0=v_main_~index~0_8} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:26:54,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} [82] L38-4-->L44-3: Formula: (= v_main_~index~0_14 0) InVars {} OutVars{main_~index~0=v_main_~index~0_14} AuxVars[] AssignedVars[main_~index~0] {34#false} is VALID [2022-04-07 22:26:54,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} [86] L44-3-->L45: Formula: (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse0 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem4_1|) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_1|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {34#false} is VALID [2022-04-07 22:26:54,962 INFO L272 TraceCheckUtils]: 9: Hoare triple {34#false} [90] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~index~0_16 4294967296) (mod |v_main_#t~mem4_4| 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem4=|v_main_#t~mem4_4|, main_~index~0=v_main_~index~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~index~0, main_#t~mem4] {34#false} is VALID [2022-04-07 22:26:54,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} [96] __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] {34#false} is VALID [2022-04-07 22:26:54,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} [99] 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[] {34#false} is VALID [2022-04-07 22:26:54,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [101] L26-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 22:26:54,964 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:26:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:26:54,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279494627] [2022-04-07 22:26:54,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279494627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:26:54,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:26:54,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:26:54,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568076587] [2022-04-07 22:26:54,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:26:54,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:54,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:26:54,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:55,007 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-07 22:26:55,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:26:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:26:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:26:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:26:55,041 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:26:55,267 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-07 22:26:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:26:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:26:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-07 22:26:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-07 22:26:55,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-04-07 22:26:55,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:26:55,370 INFO L225 Difference]: With dead ends: 62 [2022-04-07 22:26:55,370 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 22:26:55,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:26:55,375 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:26:55,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:26:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 22:26:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-04-07 22:26:55,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:26:55,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:26:55,402 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:26:55,403 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:26:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:26:55,407 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 22:26:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 22:26:55,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:26:55,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:26:55,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-07 22:26:55,409 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-07 22:26:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:26:55,412 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 22:26:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 22:26:55,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:26:55,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:26:55,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:26:55,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:26:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:26:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-07 22:26:55,417 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2022-04-07 22:26:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:26:55,417 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-07 22:26:55,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 22:26:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 22:26:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 22:26:55,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:26:55,418 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] [2022-04-07 22:26:55,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:26:55,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:26:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:26:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 364957256, now seen corresponding path program 1 times [2022-04-07 22:26:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:26:55,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323393701] [2022-04-07 22:26:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:26:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:26:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:26:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:55,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [75] 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) (= 29 (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] {229#true} is VALID [2022-04-07 22:26:55,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} [78] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {229#true} {229#true} [104] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 22:26:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:55,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#true} [88] assume_abort_if_notENTRY-->L21: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {229#true} is VALID [2022-04-07 22:26:55,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} [93] L21-->L21-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} [97] L21-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {234#(= main_~index~0 0)} [106] assume_abort_if_notEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~index~0_15 4294967296) (mod v_main_~tmp~0_4 4294967296)) 1 0)) InVars {main_~tmp~0=v_main_~tmp~0_4, main_~index~0=v_main_~index~0_15} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, assume_abort_if_not_#in~cond] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:55,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} [73] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:26:55,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [75] 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) (= 29 (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] {229#true} is VALID [2022-04-07 22:26:55,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} [78] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} [104] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} [74] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} [77] mainENTRY-->L38-3: Formula: (and (not (= |v_main_~#array~0.base_2| 0)) (= (store |v_#length_2| |v_main_~#array~0.base_2| 40000) |v_#length_1|) (= |v_main_~#array~0.offset_2| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_2| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_2|) 0) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_2|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:55,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(= main_~index~0 0)} [81] L38-3-->L40: Formula: (and (= v_main_~tmp~0_1 |v_main_#t~nondet2_2|) (< (mod v_main_~index~0_9 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_9, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~tmp~0, main_#t~nondet2] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:55,552 INFO L272 TraceCheckUtils]: 7: Hoare triple {234#(= main_~index~0 0)} [83] L40-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~index~0_15 4294967296) (mod v_main_~tmp~0_4 4294967296)) 1 0)) InVars {main_~tmp~0=v_main_~tmp~0_4, main_~index~0=v_main_~index~0_15} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, assume_abort_if_not_#in~cond] {229#true} is VALID [2022-04-07 22:26:55,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} [88] assume_abort_if_notENTRY-->L21: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {229#true} is VALID [2022-04-07 22:26:55,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} [93] L21-->L21-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {229#true} [97] L21-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:55,554 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {229#true} {234#(= main_~index~0 0)} [106] assume_abort_if_notEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~index~0_15 4294967296) (mod v_main_~tmp~0_4 4294967296)) 1 0)) InVars {main_~tmp~0=v_main_~tmp~0_4, main_~index~0=v_main_~index~0_15} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, assume_abort_if_not_#in~cond] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:55,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(= main_~index~0 0)} [87] L40-1-->L38-2: Formula: (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) (+ (* 4 (mod v_main_~index~0_11 4294967296)) |v_main_~#array~0.offset_5|) v_main_~tmp~0_3)) |v_#memory_int_2|) InVars {#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_5|, main_~index~0=v_main_~index~0_11, main_~#array~0.base=|v_main_~#array~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_5|, main_~index~0=v_main_~index~0_11, main_~#array~0.base=|v_main_~#array~0.base_5|} AuxVars[] AssignedVars[#memory_int] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:55,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#(= main_~index~0 0)} [91] L38-2-->L38-3: Formula: (= (+ v_main_~index~0_13 1) v_main_~index~0_12) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_12} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {239#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:26:55,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [80] L38-3-->L38-4: Formula: (not (< (mod v_main_~index~0_8 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_8} OutVars{main_~index~0=v_main_~index~0_8} AuxVars[] AssignedVars[] {230#false} is VALID [2022-04-07 22:26:55,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {230#false} [82] L38-4-->L44-3: Formula: (= v_main_~index~0_14 0) InVars {} OutVars{main_~index~0=v_main_~index~0_14} AuxVars[] AssignedVars[main_~index~0] {230#false} is VALID [2022-04-07 22:26:55,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} [86] L44-3-->L45: Formula: (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse0 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem4_1|) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_1|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {230#false} is VALID [2022-04-07 22:26:55,558 INFO L272 TraceCheckUtils]: 17: Hoare triple {230#false} [90] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~index~0_16 4294967296) (mod |v_main_#t~mem4_4| 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem4=|v_main_#t~mem4_4|, main_~index~0=v_main_~index~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~index~0, main_#t~mem4] {230#false} is VALID [2022-04-07 22:26:55,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {230#false} [96] __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] {230#false} is VALID [2022-04-07 22:26:55,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {230#false} [99] 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[] {230#false} is VALID [2022-04-07 22:26:55,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {230#false} [101] L26-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#false} is VALID [2022-04-07 22:26:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:26:55,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:26:55,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323393701] [2022-04-07 22:26:55,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323393701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:26:55,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180758452] [2022-04-07 22:26:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:26:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:26:55,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:26:55,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:26:55,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:26:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:55,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 22:26:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:26:55,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:26:56,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-07 22:26:56,232 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-07 22:26:56,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-04-07 22:26:57,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} [73] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:57,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} [75] 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) (= 29 (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] {229#true} is VALID [2022-04-07 22:26:57,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} [78] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:57,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} [104] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:57,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} [74] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#true} is VALID [2022-04-07 22:26:57,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} [77] mainENTRY-->L38-3: Formula: (and (not (= |v_main_~#array~0.base_2| 0)) (= (store |v_#length_2| |v_main_~#array~0.base_2| 40000) |v_#length_1|) (= |v_main_~#array~0.offset_2| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_2| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_2|) 0) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_2|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:57,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(= main_~index~0 0)} [81] L38-3-->L40: Formula: (and (= v_main_~tmp~0_1 |v_main_#t~nondet2_2|) (< (mod v_main_~index~0_9 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_9, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~tmp~0, main_#t~nondet2] {234#(= main_~index~0 0)} is VALID [2022-04-07 22:26:57,373 INFO L272 TraceCheckUtils]: 7: Hoare triple {234#(= main_~index~0 0)} [83] L40-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~index~0_15 4294967296) (mod v_main_~tmp~0_4 4294967296)) 1 0)) InVars {main_~tmp~0=v_main_~tmp~0_4, main_~index~0=v_main_~index~0_15} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, assume_abort_if_not_#in~cond] {229#true} is VALID [2022-04-07 22:26:57,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} [88] assume_abort_if_notENTRY-->L21: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 22:26:57,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [93] L21-->L21-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 22:26:57,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(not (= |assume_abort_if_not_#in~cond| 0))} [97] L21-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 22:26:57,376 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {272#(not (= |assume_abort_if_not_#in~cond| 0))} {234#(= main_~index~0 0)} [106] assume_abort_if_notEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~index~0_15 4294967296) (mod v_main_~tmp~0_4 4294967296)) 1 0)) InVars {main_~tmp~0=v_main_~tmp~0_4, main_~index~0=v_main_~index~0_15} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, assume_abort_if_not_#in~cond] {279#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} is VALID [2022-04-07 22:26:57,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {279#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} [87] L40-1-->L38-2: Formula: (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) (+ (* 4 (mod v_main_~index~0_11 4294967296)) |v_main_~#array~0.offset_5|) v_main_~tmp~0_3)) |v_#memory_int_2|) InVars {#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_5|, main_~index~0=v_main_~index~0_11, main_~#array~0.base=|v_main_~#array~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_5|, main_~index~0=v_main_~index~0_11, main_~#array~0.base=|v_main_~#array~0.base_5|} AuxVars[] AssignedVars[#memory_int] {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-07 22:26:57,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} [91] L38-2-->L38-3: Formula: (= (+ v_main_~index~0_13 1) v_main_~index~0_12) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_12} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-07 22:26:57,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} [80] L38-3-->L38-4: Formula: (not (< (mod v_main_~index~0_8 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_8} OutVars{main_~index~0=v_main_~index~0_8} AuxVars[] AssignedVars[] {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-07 22:26:57,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {283#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} [82] L38-4-->L44-3: Formula: (= v_main_~index~0_14 0) InVars {} OutVars{main_~index~0=v_main_~index~0_14} AuxVars[] AssignedVars[main_~index~0] {293#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-07 22:26:57,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} [86] L44-3-->L45: Formula: (let ((.cse0 (mod v_main_~index~0_2 4294967296))) (and (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse0 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem4_1|) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_1|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {297#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-07 22:26:57,503 INFO L272 TraceCheckUtils]: 17: Hoare triple {297#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} [90] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~index~0_16 4294967296) (mod |v_main_#t~mem4_4| 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem4=|v_main_#t~mem4_4|, main_~index~0=v_main_~index~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~index~0, main_#t~mem4] {301#(exists ((|aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| Int) (|aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int) (|aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int)) (and (<= 0 |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (<= 1 |__VERIFIER_assert_#in~cond|) (< |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| (+ |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 1)) (<= (+ (* |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 4294967296) |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (+ 4294967294 (* |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| 4294967296)))))} is VALID [2022-04-07 22:26:57,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {301#(exists ((|aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| Int) (|aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int) (|aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int)) (and (<= 0 |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (<= 1 |__VERIFIER_assert_#in~cond|) (< |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| (+ |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 1)) (<= (+ (* |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 4294967296) |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (+ 4294967294 (* |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| 4294967296)))))} [96] __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] {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:26:57,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {230#false} is VALID [2022-04-07 22:26:57,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {230#false} [101] L26-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#false} is VALID [2022-04-07 22:26:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:26:57,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:26:57,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-07 22:26:57,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52