/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_3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:32:03,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:32:03,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:32:03,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:32:03,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:32:03,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:32:03,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:32:03,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:32:03,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:32:03,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:32:03,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:32:03,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:32:03,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:32:03,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:32:03,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:32:03,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:32:03,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:32:03,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:32:03,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:32:03,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:32:03,199 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:32:03,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:32:03,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:32:03,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:32:03,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:32:03,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:32:03,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:32:03,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:32:03,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:32:03,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:32:03,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:32:03,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:32:03,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:32:03,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:32:03,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:32:03,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:32:03,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:32:03,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:32:03,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:32:03,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:32:03,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:32:03,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:32:03,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:32:03,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:32:03,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:32:03,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:32:03,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:32:03,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:32:03,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:32:03,237 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:32:03,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:32:03,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:32:03,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:32:03,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:03,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:32:03,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:32:03,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:32:03,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:32:03,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:32:03,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:32:03,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:32:03,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:32:03,240 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:32:03,240 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-15 00:32:03,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:32:03,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:32:03,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:32:03,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:32:03,444 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:32:03,445 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_3.i [2022-04-15 00:32:03,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed638ec/fbf854e953da4305855d6b31ec80bdcb/FLAG13811ab44 [2022-04-15 00:32:03,834 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:32:03,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-15 00:32:03,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed638ec/fbf854e953da4305855d6b31ec80bdcb/FLAG13811ab44 [2022-04-15 00:32:04,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed638ec/fbf854e953da4305855d6b31ec80bdcb [2022-04-15 00:32:04,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:32:04,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:32:04,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:04,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:32:04,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:32:04,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73184ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04, skipping insertion in model container [2022-04-15 00:32:04,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:32:04,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:32:04,436 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_3.i[920,933] [2022-04-15 00:32:04,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:04,462 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:32:04,476 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_3.i[920,933] [2022-04-15 00:32:04,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:04,491 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:32:04,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04 WrapperNode [2022-04-15 00:32:04,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:04,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:32:04,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:32:04,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:32:04,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:32:04,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:32:04,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:32:04,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:32:04,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:04,548 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-15 00:32:04,553 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-15 00:32:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:32:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:32:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:32:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:32:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:32:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:32:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:32:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:32:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:32:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:32:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:32:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:32:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:32:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:32:04,622 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:32:04,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:32:04,793 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:32:04,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:32:04,798 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:32:04,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:04 BoogieIcfgContainer [2022-04-15 00:32:04,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:32:04,800 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:32:04,800 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:32:04,800 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:32:04,802 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:04" (1/1) ... [2022-04-15 00:32:04,804 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:32:04,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:04 BasicIcfg [2022-04-15 00:32:04,829 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:32:04,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:32:04,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:32:04,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:32:04,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:04" (1/4) ... [2022-04-15 00:32:04,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba925a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:04, skipping insertion in model container [2022-04-15 00:32:04,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:04" (2/4) ... [2022-04-15 00:32:04,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba925a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:04, skipping insertion in model container [2022-04-15 00:32:04,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:04" (3/4) ... [2022-04-15 00:32:04,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba925a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:04, skipping insertion in model container [2022-04-15 00:32:04,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:04" (4/4) ... [2022-04-15 00:32:04,836 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.iqvasr [2022-04-15 00:32:04,840 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:32:04,840 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:32:04,882 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:32:04,889 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-15 00:32:04,889 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:32:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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-15 00:32:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:32:04,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:04,905 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:04,906 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash -282439964, now seen corresponding path program 1 times [2022-04-15 00:32:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:04,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399224803] [2022-04-15 00:32:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:04,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:05,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-15 00:32:05,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:32:05,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:32:05,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:05,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-15 00:32:05,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:32:05,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:32:05,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:32:05,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {27#true} is VALID [2022-04-15 00:32:05,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [80] L38-2-->L38-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:32:05,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {28#false} is VALID [2022-04-15 00:32:05,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {28#false} is VALID [2022-04-15 00:32:05,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [88] L45-->L45-2: Formula: |v_main_#t~short4_2| InVars {main_#t~short4=|v_main_#t~short4_2|} OutVars{main_#t~short4=|v_main_#t~short4_2|} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:32:05,079 INFO L272 TraceCheckUtils]: 10: Hoare triple {28#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {28#false} is VALID [2022-04-15 00:32:05,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-15 00:32:05,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:32:05,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:32:05,080 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-15 00:32:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:05,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399224803] [2022-04-15 00:32:05,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399224803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:05,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:05,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:32:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082673455] [2022-04-15 00:32:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:05,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:05,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:05,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 00:32:05,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:05,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:32:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:32:05,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:32:05,119 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 00:32:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,179 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 00:32:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:32:05,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 00:32:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 00:32:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 00:32:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 00:32:05,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-15 00:32:05,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:05,263 INFO L225 Difference]: With dead ends: 41 [2022-04-15 00:32:05,263 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 00:32:05,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:32:05,268 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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-15 00:32:05,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:32:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 00:32:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 00:32:05,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:05,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:05,310 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:05,310 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,312 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 00:32:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 00:32:05,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:05,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:05,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 00:32:05,313 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 00:32:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,315 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 00:32:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 00:32:05,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:05,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:05,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:05,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 00:32:05,318 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-15 00:32:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:05,318 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 00:32:05,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 00:32:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 00:32:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:32:05,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:05,319 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:05,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:32:05,319 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1460370371, now seen corresponding path program 1 times [2022-04-15 00:32:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117265981] [2022-04-15 00:32:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:05,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {152#true} is VALID [2022-04-15 00:32:05,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 00:32:05,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 00:32:05,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:05,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {152#true} is VALID [2022-04-15 00:32:05,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 00:32:05,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 00:32:05,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 00:32:05,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {152#true} is VALID [2022-04-15 00:32:05,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 00:32:05,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {152#true} is VALID [2022-04-15 00:32:05,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {152#true} is VALID [2022-04-15 00:32:05,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} [88] L45-->L45-2: Formula: |v_main_#t~short4_2| InVars {main_#t~short4=|v_main_#t~short4_2|} OutVars{main_#t~short4=|v_main_#t~short4_2|} AuxVars[] AssignedVars[] {157#|main_#t~short4|} is VALID [2022-04-15 00:32:05,467 INFO L272 TraceCheckUtils]: 10: Hoare triple {157#|main_#t~short4|} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {158#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:05,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {158#(not (= |__VERIFIER_assert_#in~cond| 0))} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {159#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:05,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#(not (= __VERIFIER_assert_~cond 0))} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {153#false} is VALID [2022-04-15 00:32:05,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {153#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#false} is VALID [2022-04-15 00:32:05,494 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-15 00:32:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117265981] [2022-04-15 00:32:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117265981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:05,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471207211] [2022-04-15 00:32:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:05,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:05,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:05,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:05,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:05,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:05,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:05,515 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,690 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 00:32:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-15 00:32:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-15 00:32:05,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-15 00:32:05,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:05,722 INFO L225 Difference]: With dead ends: 27 [2022-04-15 00:32:05,722 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 00:32:05,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:05,728 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:05,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 00:32:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 00:32:05,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:05,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,737 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,737 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,739 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:32:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 00:32:05,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:05,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:05,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 00:32:05,740 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 00:32:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,742 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:32:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 00:32:05,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:05,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:05,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:05,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 00:32:05,746 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-15 00:32:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:05,747 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 00:32:05,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 00:32:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:32:05,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:05,748 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:05,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:32:05,749 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1461293892, now seen corresponding path program 1 times [2022-04-15 00:32:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:05,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165607285] [2022-04-15 00:32:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:05,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {292#true} is VALID [2022-04-15 00:32:05,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-04-15 00:32:05,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-04-15 00:32:05,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:05,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {292#true} is VALID [2022-04-15 00:32:05,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-04-15 00:32:05,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-04-15 00:32:05,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-04-15 00:32:05,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {297#(= main_~index~0 0)} is VALID [2022-04-15 00:32:05,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {297#(= main_~index~0 0)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {293#false} is VALID [2022-04-15 00:32:05,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {293#false} is VALID [2022-04-15 00:32:05,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {293#false} is VALID [2022-04-15 00:32:05,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {293#false} is VALID [2022-04-15 00:32:05,843 INFO L272 TraceCheckUtils]: 10: Hoare triple {293#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {293#false} is VALID [2022-04-15 00:32:05,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {293#false} is VALID [2022-04-15 00:32:05,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {293#false} is VALID [2022-04-15 00:32:05,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#false} is VALID [2022-04-15 00:32:05,844 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-15 00:32:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:05,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165607285] [2022-04-15 00:32:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165607285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:05,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:32:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620841195] [2022-04-15 00:32:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:05,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:05,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 00:32:05,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:05,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:32:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:32:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:32:05,857 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 00:32:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,927 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 00:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:32:05,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 00:32:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 00:32:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 00:32:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 00:32:05,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-15 00:32:05,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:05,966 INFO L225 Difference]: With dead ends: 48 [2022-04-15 00:32:05,966 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 00:32:05,968 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-15 00:32:05,971 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:05,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:32:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 00:32:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-15 00:32:05,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:05,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,979 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,979 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,984 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 00:32:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 00:32:05,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:05,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:05,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 00:32:05,986 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 00:32:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:05,991 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 00:32:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 00:32:05,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:05,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:05,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:05,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 00:32:05,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-15 00:32:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:05,996 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 00:32:05,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 00:32:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 00:32:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:32:05,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:05,997 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:05,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:32:05,998 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1397977152, now seen corresponding path program 1 times [2022-04-15 00:32:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772716357] [2022-04-15 00:32:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:06,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {468#true} is VALID [2022-04-15 00:32:06,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:06,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {468#true} is VALID [2022-04-15 00:32:06,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {473#(= main_~index~0 0)} is VALID [2022-04-15 00:32:06,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(= main_~index~0 0)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {474#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:32:06,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {469#false} is VALID [2022-04-15 00:32:06,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {469#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {469#false} is VALID [2022-04-15 00:32:06,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,108 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-15 00:32:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772716357] [2022-04-15 00:32:06,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772716357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:06,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373695760] [2022-04-15 00:32:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:06,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:06,111 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-15 00:32:06,132 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-15 00:32:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:06,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 00:32:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:06,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:06,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-15 00:32:06,306 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 33 treesize of output 21 [2022-04-15 00:32:06,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {468#true} is VALID [2022-04-15 00:32:06,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {494#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 00:32:06,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {494#(and (= main_~index~0 0) (= main_~tmp~0 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {498#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 00:32:06,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {498#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 00:32:06,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {505#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 00:32:06,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {509#|main_#t~short4|} is VALID [2022-04-15 00:32:06,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#|main_#t~short4|} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,324 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {469#false} is VALID [2022-04-15 00:32:06,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,325 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-15 00:32:06,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:06,411 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 18 treesize of output 16 [2022-04-15 00:32:06,425 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 34 treesize of output 32 [2022-04-15 00:32:06,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 00:32:06,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {469#false} is VALID [2022-04-15 00:32:06,511 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#|main_#t~short4|} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {469#false} is VALID [2022-04-15 00:32:06,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296))} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {509#|main_#t~short4|} is VALID [2022-04-15 00:32:06,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {540#(= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296))} is VALID [2022-04-15 00:32:06,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {544#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 00:32:06,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {551#(and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|)))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {544#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 00:32:06,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {551#(and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|)))} is VALID [2022-04-15 00:32:06,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {468#true} is VALID [2022-04-15 00:32:06,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 00:32:06,529 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-15 00:32:06,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373695760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:06,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:06,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-04-15 00:32:06,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343035288] [2022-04-15 00:32:06,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:06,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:32:06,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:06,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:06,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:06,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 00:32:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 00:32:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:32:06,562 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:06,951 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-15 00:32:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:32:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:32:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-15 00:32:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-15 00:32:06,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2022-04-15 00:32:07,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:07,007 INFO L225 Difference]: With dead ends: 58 [2022-04-15 00:32:07,007 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 00:32:07,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-15 00:32:07,009 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:07,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 41 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 101 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-04-15 00:32:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 00:32:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-04-15 00:32:07,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:07,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:07,018 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:07,018 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:07,019 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-15 00:32:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-15 00:32:07,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:07,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:07,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 00:32:07,020 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 00:32:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:07,021 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-15 00:32:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-15 00:32:07,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:07,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:07,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:07,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 00:32:07,023 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-15 00:32:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:07,023 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 00:32:07,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 00:32:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 00:32:07,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:07,023 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:07,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:32:07,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:07,240 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 158933700, now seen corresponding path program 2 times [2022-04-15 00:32:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:07,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533901070] [2022-04-15 00:32:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:07,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:07,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {787#true} is VALID [2022-04-15 00:32:07,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {787#true} {787#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:07,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {787#true} is VALID [2022-04-15 00:32:07,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {792#(= main_~index~0 0)} is VALID [2022-04-15 00:32:07,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {792#(= main_~index~0 0)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {793#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 00:32:07,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {794#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:32:07,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {788#false} is VALID [2022-04-15 00:32:07,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,340 INFO L272 TraceCheckUtils]: 12: Hoare triple {788#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {788#false} is VALID [2022-04-15 00:32:07,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:07,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533901070] [2022-04-15 00:32:07,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533901070] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:07,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248698932] [2022-04-15 00:32:07,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:32:07,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:07,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:32:07,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:32:07,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:32:07,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:32:07,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 00:32:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:07,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:07,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-15 00:32:07,454 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 00:32:07,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 00:32:07,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {787#true} is VALID [2022-04-15 00:32:07,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {814#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 00:32:07,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {814#(and (= main_~index~0 0) (= main_~tmp~0 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {818#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-15 00:32:07,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {818#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {822#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 00:32:07,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {822#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 00:32:07,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {829#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 00:32:07,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {829#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {833#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-15 00:32:07,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,540 INFO L272 TraceCheckUtils]: 12: Hoare triple {788#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {788#false} is VALID [2022-04-15 00:32:07,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:07,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:07,735 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 29 treesize of output 27 [2022-04-15 00:32:07,751 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 210 treesize of output 206 [2022-04-15 00:32:07,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-15 00:32:07,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {788#false} is VALID [2022-04-15 00:32:07,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {788#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {861#|main_#t~short4|} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {788#false} is VALID [2022-04-15 00:32:07,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {865#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {861#|main_#t~short4|} is VALID [2022-04-15 00:32:07,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {869#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {865#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-15 00:32:07,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {869#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {869#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 00:32:07,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {876#(forall ((v_ArrVal_31 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_31) |main_~#array~0.offset|) 4294967296) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {869#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 00:32:07,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#(and (= (mod main_~tmp~0 4294967296) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {876#(forall ((v_ArrVal_31 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_31) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 00:32:07,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {880#(and (= (mod main_~tmp~0 4294967296) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-15 00:32:07,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {787#true} is VALID [2022-04-15 00:32:07,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-15 00:32:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:07,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248698932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:07,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:07,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-04-15 00:32:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348127588] [2022-04-15 00:32:07,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 00:32:07,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:07,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:07,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:07,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 00:32:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 00:32:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-15 00:32:07,883 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:08,440 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 00:32:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 00:32:08,441 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 00:32:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-15 00:32:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-15 00:32:08,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-04-15 00:32:08,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:08,495 INFO L225 Difference]: With dead ends: 66 [2022-04-15 00:32:08,495 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 00:32:08,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-04-15 00:32:08,496 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:08,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 192 Invalid, 0 Unknown, 1 Unchecked, 0.2s Time] [2022-04-15 00:32:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 00:32:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-04-15 00:32:08,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:08,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:08,507 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:08,507 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:08,509 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-15 00:32:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-15 00:32:08,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:08,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:08,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 00:32:08,510 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 00:32:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:08,511 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-15 00:32:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-15 00:32:08,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:08,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:08,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:08,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 00:32:08,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-15 00:32:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:08,513 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 00:32:08,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 00:32:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:32:08,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:08,513 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:08,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 00:32:08,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:08,727 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1178529856, now seen corresponding path program 3 times [2022-04-15 00:32:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:08,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851362083] [2022-04-15 00:32:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:08,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1154#true} is VALID [2022-04-15 00:32:08,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1154#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1154#true} {1154#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1154#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:08,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1154#true} is VALID [2022-04-15 00:32:08,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1154#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {1154#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1159#(= main_~index~0 0)} is VALID [2022-04-15 00:32:08,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {1159#(= main_~index~0 0)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1160#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 00:32:08,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1161#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 00:32:08,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1162#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:32:08,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {1155#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {1155#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L272 TraceCheckUtils]: 13: Hoare triple {1155#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1155#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {1155#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:08,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {1155#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:08,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851362083] [2022-04-15 00:32:08,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851362083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:08,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895559448] [2022-04-15 00:32:08,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 00:32:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:08,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:32:08,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:32:08,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-15 00:32:08,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:32:08,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 00:32:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:08,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:08,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {1154#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {1154#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1154#true} is VALID [2022-04-15 00:32:08,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {1154#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:08,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1154#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1159#(= main_~index~0 0)} is VALID [2022-04-15 00:32:08,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1159#(= main_~index~0 0)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1160#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 00:32:08,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1161#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 00:32:08,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1191#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 00:32:08,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {1155#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1155#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {1155#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {1155#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {1155#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {1155#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:08,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:09,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {1155#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:09,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {1155#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:09,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {1155#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1155#false} is VALID [2022-04-15 00:32:09,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {1155#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:09,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:09,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {1155#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {1155#false} is VALID [2022-04-15 00:32:09,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1155#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {1155#false} is VALID [2022-04-15 00:32:09,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1237#(< (mod main_~index~0 4294967296) 10000)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1155#false} is VALID [2022-04-15 00:32:09,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1241#(< (mod (+ main_~index~0 1) 4294967296) 10000)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1237#(< (mod main_~index~0 4294967296) 10000)} is VALID [2022-04-15 00:32:09,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1241#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-15 00:32:09,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {1249#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1245#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-15 00:32:09,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1154#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1249#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-15 00:32:09,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:09,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:09,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {1154#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:09,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1154#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1154#true} is VALID [2022-04-15 00:32:09,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {1154#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-15 00:32:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:09,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895559448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:09,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:09,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 00:32:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271564106] [2022-04-15 00:32:09,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 00:32:09,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:09,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:09,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:09,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 00:32:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:09,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 00:32:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:32:09,092 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:09,891 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2022-04-15 00:32:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 00:32:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 00:32:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-15 00:32:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-15 00:32:09,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2022-04-15 00:32:09,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:09,979 INFO L225 Difference]: With dead ends: 92 [2022-04-15 00:32:09,979 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 00:32:09,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-04-15 00:32:09,980 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:09,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 52 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 00:32:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 32. [2022-04-15 00:32:10,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:10,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:10,009 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:10,009 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:10,011 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2022-04-15 00:32:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-15 00:32:10,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:10,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:10,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 75 states. [2022-04-15 00:32:10,012 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 75 states. [2022-04-15 00:32:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:10,014 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2022-04-15 00:32:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-15 00:32:10,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:10,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:10,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:10,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 00:32:10,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2022-04-15 00:32:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:10,016 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 00:32:10,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 00:32:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 00:32:10,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:10,016 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:10,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:32:10,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:10,233 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:10,233 INFO L85 PathProgramCache]: Analyzing trace with hash 815042884, now seen corresponding path program 4 times [2022-04-15 00:32:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516693713] [2022-04-15 00:32:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:10,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {1637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1623#true} is VALID [2022-04-15 00:32:10,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1623#true} {1623#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:10,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1623#true} is VALID [2022-04-15 00:32:10,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1628#(= main_~index~0 0)} is VALID [2022-04-15 00:32:10,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= main_~index~0 0)} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1629#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 00:32:10,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1630#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 00:32:10,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1631#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 00:32:10,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {1631#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1632#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-15 00:32:10,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {1632#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1633#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-15 00:32:10,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1633#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1634#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-15 00:32:10,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1635#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-15 00:32:10,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {1635#(and (<= 7 main_~index~0) (<= main_~index~0 7))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1636#(and (<= main_~index~0 8) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:32:10,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {1636#(and (<= main_~index~0 8) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1624#false} is VALID [2022-04-15 00:32:10,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {1624#false} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {1624#false} is VALID [2022-04-15 00:32:10,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {1624#false} is VALID [2022-04-15 00:32:10,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {1624#false} is VALID [2022-04-15 00:32:10,372 INFO L272 TraceCheckUtils]: 18: Hoare triple {1624#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {1624#false} is VALID [2022-04-15 00:32:10,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {1624#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1624#false} is VALID [2022-04-15 00:32:10,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {1624#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1624#false} is VALID [2022-04-15 00:32:10,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {1624#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1624#false} is VALID [2022-04-15 00:32:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:10,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516693713] [2022-04-15 00:32:10,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516693713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:10,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163373262] [2022-04-15 00:32:10,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 00:32:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:10,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:32:10,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 00:32:10,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 00:32:10,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:32:10,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 00:32:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:10,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:10,471 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 19 treesize of output 15 [2022-04-15 00:32:10,506 INFO L356 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2022-04-15 00:32:10,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-04-15 00:32:10,539 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 00:32:10,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 00:32:10,578 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 00:32:10,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 00:32:10,610 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-04-15 00:32:10,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-15 00:32:10,644 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 00:32:10,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 00:32:10,673 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 00:32:10,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 00:32:10,704 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 00:32:10,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-15 00:32:10,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 29 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #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_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1623#true} is VALID [2022-04-15 00:32:10,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-15 00:32:10,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} [78] mainENTRY-->L38-2: Formula: (and (not (= |v_main_~#array~0.base_3| 0)) (= |v_main_~#array~0.offset_3| 0) (= v_main_~tmp~0_1 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (= v_main_~index~0_6 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0) (= (store |v_#length_2| |v_main_~#array~0.base_3| 40000) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~tmp~0=v_main_~tmp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_6, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1656#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-15 00:32:10,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(and (= main_~index~0 0) (= main_~tmp~0 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1660#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 00:32:10,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1660#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1664#(and (= (+ (- 2) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 0))} is VALID [2022-04-15 00:32:10,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1664#(and (= (+ (- 2) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1668#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-15 00:32:10,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {1668#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1672#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 00:32:10,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {1672#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1676#(and (= 4 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 00:32:10,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(and (= 4 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1680#(and (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 00:32:10,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {1680#(and (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1684#(and (= 7 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 00:32:10,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {1684#(and (= 7 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [82] L38-2-->L38-2: Formula: (let ((.cse0 (mod v_main_~index~0_9 4294967296))) (and (= (+ v_main_~tmp~0_3 2) v_main_~tmp~0_2) (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) v_main_~tmp~0_3)) |v_#memory_int_3|) (= (+ v_main_~index~0_9 1) v_main_~index~0_8) (< .cse0 10000))) InVars {#memory_int=|v_#memory_int_4|, main_~tmp~0=v_main_~tmp~0_3, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_9, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~tmp~0=v_main_~tmp~0_2, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[main_~tmp~0, main_~index~0, #memory_int] {1688#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 00:32:10,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [81] L38-2-->L38-3: Formula: (not (< (mod v_main_~index~0_7 4294967296) 10000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1688#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 00:32:10,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [83] L38-3-->L44-3: Formula: (= v_main_~index~0_10 0) InVars {} OutVars{main_~index~0=v_main_~index~0_10} AuxVars[] AssignedVars[main_~index~0] {1695#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 00:32:10,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [86] L44-3-->L45: Formula: (let ((.cse1 (mod v_main_~index~0_2 4294967296))) (and (let ((.cse0 (= (mod |v_main_#t~mem2_1| 4294967296) (mod (* 2 v_main_~index~0_2) 4294967296)))) (or (and |v_main_#t~short4_1| .cse0) (and (not .cse0) (not |v_main_#t~short4_1|)))) (< .cse1 10000) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* .cse1 4) |v_main_~#array~0.offset_1|)) |v_main_#t~mem2_1|))) 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{main_~index~0=v_main_~index~0_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|, main_#t~short4=|v_main_#t~short4_1|} AuxVars[] AssignedVars[main_#t~mem2, main_#t~short4] {1699#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-15 00:32:10,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {1699#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} [89] L45-->L45-2: Formula: (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ |v_main_~#array~0.offset_2| (* (mod v_main_~index~0_3 4294967296) 4))) |v_main_#t~mem3_1|) (let ((.cse0 (= (mod |v_main_#t~mem3_1| 4294967296) 0))) (or (and |v_main_#t~short4_3| .cse0) (and (not .cse0) (not |v_main_#t~short4_3|)))) (not |v_main_#t~short4_4|)) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_3, main_#t~short4=|v_main_#t~short4_4|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{main_~index~0=v_main_~index~0_3, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_2|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_#t~short4=|v_main_#t~short4_3|} AuxVars[] AssignedVars[main_#t~mem3, main_#t~short4] {1624#false} is VALID [2022-04-15 00:32:10,776 INFO L272 TraceCheckUtils]: 18: Hoare triple {1624#false} [91] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite |v_main_#t~short4_7| 1 0)) InVars {main_#t~short4=|v_main_#t~short4_7|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~short4] {1624#false} is VALID [2022-04-15 00:32:10,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {1624#false} [93] __VERIFIER_assertENTRY-->L26: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1624#false} is VALID [2022-04-15 00:32:10,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {1624#false} [95] L26-->L27: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1624#false} is VALID [2022-04-15 00:32:10,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {1624#false} [97] L27-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1624#false} is VALID [2022-04-15 00:32:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:10,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:13,227 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 95 treesize of output 93 [2022-04-15 00:32:13,688 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 2080898790 treesize of output 2080374502