/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-fb4f59a-m [2022-04-27 21:32:58,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:32:58,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:32:58,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:32:58,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:32:58,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:32:58,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:32:58,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:32:58,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:32:58,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:32:58,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:32:58,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:32:58,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:32:58,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:32:58,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:32:58,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:32:58,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:32:58,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:32:58,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:32:58,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:32:58,613 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:32:58,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:32:58,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:32:58,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:32:58,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:32:58,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:32:58,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:32:58,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:32:58,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:32:58,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:32:58,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:32:58,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:32:58,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:32:58,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:32:58,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:32:58,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:32:58,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:32:58,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:32:58,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:32:58,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:32:58,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:32:58,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:32:58,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:32:58,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:32:58,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:32:58,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:32:58,665 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:32:58,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:32:58,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:32:58,667 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:32:58,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:32:58,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:32:58,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:32:58,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:32:58,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:32:58,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:32:58,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:32:58,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:32:58,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:32:58,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:32:58,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:32:58,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:32:58,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:32:58,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:32:58,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:32:58,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:32:58,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:32:58,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:32:58,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:32:58,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:32:58,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:32:58,672 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:32:58,672 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:32:58,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:32:58,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:32:58,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:32:58,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:32:58,941 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:32:58,942 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-27 21:32:59,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f135a11e4/a334b47627ba48848c57da92a868147e/FLAG02f6d1d6c [2022-04-27 21:32:59,408 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:32:59,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-27 21:32:59,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f135a11e4/a334b47627ba48848c57da92a868147e/FLAG02f6d1d6c [2022-04-27 21:32:59,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f135a11e4/a334b47627ba48848c57da92a868147e [2022-04-27 21:32:59,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:32:59,827 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:32:59,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:32:59,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:32:59,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:32:59,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:32:59" (1/1) ... [2022-04-27 21:32:59,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7118fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:32:59, skipping insertion in model container [2022-04-27 21:32:59,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:32:59" (1/1) ... [2022-04-27 21:32:59,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:32:59,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:32:59,995 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-27 21:33:00,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:33:00,017 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:33:00,028 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-27 21:33:00,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:33:00,046 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:33:00,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00 WrapperNode [2022-04-27 21:33:00,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:33:00,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:33:00,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:33:00,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:33:00,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:33:00,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:33:00,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:33:00,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:33:00,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:33:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:00,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:33:00,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:33:00,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:33:00,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:33:00,149 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:33:00,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:33:00,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:33:00,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:33:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:33:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:33:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:33:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:33:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:33:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:33:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:33:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:33:00,203 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:33:00,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:33:00,332 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:33:00,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:33:00,338 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 21:33:00,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:33:00 BoogieIcfgContainer [2022-04-27 21:33:00,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:33:00,341 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:33:00,341 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:33:00,342 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:33:00,345 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:33:00" (1/1) ... [2022-04-27 21:33:00,347 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:33:00,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:33:00 BasicIcfg [2022-04-27 21:33:00,377 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:33:00,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:33:00,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:33:00,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:33:00,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:32:59" (1/4) ... [2022-04-27 21:33:00,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4653d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:33:00, skipping insertion in model container [2022-04-27 21:33:00,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:00" (2/4) ... [2022-04-27 21:33:00,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4653d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:33:00, skipping insertion in model container [2022-04-27 21:33:00,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:33:00" (3/4) ... [2022-04-27 21:33:00,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4653d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:33:00, skipping insertion in model container [2022-04-27 21:33:00,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:33:00" (4/4) ... [2022-04-27 21:33:00,399 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.iqvasr [2022-04-27 21:33:00,413 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:33:00,413 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:33:00,462 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:33:00,482 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@638b5798, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f9c7f38 [2022-04-27 21:33:00,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:33:00,490 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-27 21:33:00,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:33:00,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:00,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:00,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash -282439964, now seen corresponding path program 1 times [2022-04-27 21:33:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:00,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201364917] [2022-04-27 21:33:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:00,651 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-27 21:33:00,652 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-27 21:33:00,652 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-27 21:33:00,654 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-27 21:33:00,655 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-27 21:33:00,655 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-27 21:33:00,655 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-27 21:33:00,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:33:00,656 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-27 21:33:00,657 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-27 21:33:00,657 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-27 21:33:00,658 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-27 21:33:00,658 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-27 21:33:00,658 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-27 21:33:00,658 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-27 21:33:00,659 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-27 21:33:00,659 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-27 21:33:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:33:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:00,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201364917] [2022-04-27 21:33:00,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201364917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:33:00,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:33:00,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:33:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388425186] [2022-04-27 21:33:00,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:33:00,668 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-27 21:33:00,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:00,673 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-27 21:33:00,690 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-27 21:33:00,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:33:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:33:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:33:00,712 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-27 21:33:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:00,815 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 21:33:00,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:33:00,816 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-27 21:33:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:00,818 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-27 21:33:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 21:33:00,831 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-27 21:33:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 21:33:00,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 21:33:00,917 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-27 21:33:00,928 INFO L225 Difference]: With dead ends: 41 [2022-04-27 21:33:00,928 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 21:33:00,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:33:00,937 INFO L413 NwaCegarLoop]: 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-27 21:33:00,938 INFO L414 NwaCegarLoop]: 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-27 21:33:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 21:33:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 21:33:00,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:00,972 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-27 21:33:00,973 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-27 21:33:00,974 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-27 21:33:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:00,982 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 21:33:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:33:00,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:00,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:00,983 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-27 21:33:00,984 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-27 21:33:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:00,987 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 21:33:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:33:00,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:00,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:00,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:00,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:00,996 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-27 21:33:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 21:33:00,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-27 21:33:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:00,999 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 21:33:01,000 INFO L496 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-27 21:33:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:33:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:33:01,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:01,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:33:01,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1460370371, now seen corresponding path program 1 times [2022-04-27 21:33:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:01,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456007537] [2022-04-27 21:33:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,192 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-27 21:33:01,192 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-27 21:33:01,192 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-27 21:33:01,193 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-27 21:33:01,194 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-27 21:33:01,194 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-27 21:33:01,194 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-27 21:33:01,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-27 21:33:01,195 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-27 21:33:01,195 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-27 21:33:01,195 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-27 21:33:01,196 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-27 21:33:01,198 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-27 21:33:01,199 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-27 21:33:01,199 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-27 21:33:01,200 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-27 21:33:01,200 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-27 21:33:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:33:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:01,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456007537] [2022-04-27 21:33:01,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456007537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:33:01,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:33:01,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:33:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278289941] [2022-04-27 21:33:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:33:01,203 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-27 21:33:01,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:01,203 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-27 21:33:01,216 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-27 21:33:01,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:33:01,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:33:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:33:01,218 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-27 21:33:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:01,405 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 21:33:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:33:01,405 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-27 21:33:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:01,405 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-27 21:33:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 21:33:01,407 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-27 21:33:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 21:33:01,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-27 21:33:01,437 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-27 21:33:01,438 INFO L225 Difference]: With dead ends: 27 [2022-04-27 21:33:01,439 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 21:33:01,439 INFO L412 NwaCegarLoop]: 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-27 21:33:01,440 INFO L413 NwaCegarLoop]: 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-27 21:33:01,441 INFO L414 NwaCegarLoop]: 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-27 21:33:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 21:33:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 21:33:01,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:01,445 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-27 21:33:01,445 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-27 21:33:01,446 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-27 21:33:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:01,447 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 21:33:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 21:33:01,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:01,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:01,448 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-27 21:33:01,448 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-27 21:33:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:01,450 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 21:33:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 21:33:01,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:01,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:01,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:01,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:01,451 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-27 21:33:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 21:33:01,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-27 21:33:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:01,453 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 21:33:01,453 INFO L496 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-27 21:33:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 21:33:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:33:01,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:01,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:33:01,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1461293892, now seen corresponding path program 1 times [2022-04-27 21:33:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:01,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433377565] [2022-04-27 21:33:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,503 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-27 21:33:01,504 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-27 21:33:01,504 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-27 21:33:01,505 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-27 21:33:01,505 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-27 21:33:01,505 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-27 21:33:01,505 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-27 21:33:01,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-04-27 21:33:01,506 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-27 21:33:01,507 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-27 21:33:01,507 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-27 21:33:01,507 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-27 21:33:01,507 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-27 21:33:01,508 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-27 21:33:01,508 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-27 21:33:01,508 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-27 21:33:01,508 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-27 21:33:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:33:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433377565] [2022-04-27 21:33:01,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433377565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:33:01,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:33:01,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:33:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360160952] [2022-04-27 21:33:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:33:01,510 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-27 21:33:01,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:01,510 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-27 21:33:01,522 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-27 21:33:01,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:33:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:33:01,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:33:01,524 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-27 21:33:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:01,625 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 21:33:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:33:01,625 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-27 21:33:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:01,626 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-27 21:33:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-27 21:33:01,628 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-27 21:33:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-27 21:33:01,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-27 21:33:01,675 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-27 21:33:01,676 INFO L225 Difference]: With dead ends: 48 [2022-04-27 21:33:01,676 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 21:33:01,677 INFO L412 NwaCegarLoop]: 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-27 21:33:01,678 INFO L413 NwaCegarLoop]: 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-27 21:33:01,678 INFO L414 NwaCegarLoop]: 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-27 21:33:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 21:33:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-27 21:33:01,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:01,684 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-27 21:33:01,684 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-27 21:33:01,684 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-27 21:33:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:01,687 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 21:33:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-27 21:33:01,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:01,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:01,688 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-27 21:33:01,688 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-27 21:33:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:01,690 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 21:33:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-27 21:33:01,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:01,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:01,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:01,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:01,691 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-27 21:33:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 21:33:01,692 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-27 21:33:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:01,693 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 21:33:01,693 INFO L496 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-27 21:33:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 21:33:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:33:01,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:01,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:01,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:33:01,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1397977152, now seen corresponding path program 1 times [2022-04-27 21:33:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318118867] [2022-04-27 21:33:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,781 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-27 21:33:01,782 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-27 21:33:01,782 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-27 21:33:01,783 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-27 21:33:01,783 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-27 21:33:01,783 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-27 21:33:01,783 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-27 21:33:01,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-27 21:33:01,784 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-27 21:33:01,785 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-27 21:33:01,786 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-27 21:33:01,786 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-27 21:33:01,786 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-27 21:33:01,786 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-27 21:33:01,786 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-27 21:33:01,787 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-27 21:33:01,787 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-27 21:33:01,787 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-27 21:33:01,787 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-27 21:33:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318118867] [2022-04-27 21:33:01,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318118867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:33:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825438410] [2022-04-27 21:33:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:01,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:01,791 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-27 21:33:01,797 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-27 21:33:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 21:33:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:01,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:33:01,952 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-27 21:33:02,073 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-27 21:33:02,094 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-27 21:33:02,095 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-27 21:33:02,095 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-27 21:33:02,095 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-27 21:33:02,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-27 21:33:02,099 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-27 21:33:02,100 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-27 21:33:02,101 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-27 21:33:02,101 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-27 21:33:02,102 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-27 21:33:02,103 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-27 21:33:02,103 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-27 21:33:02,103 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-27 21:33:02,104 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-27 21:33:02,104 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-27 21:33:02,105 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-27 21:33:02,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:33:02,244 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-27 21:33:02,257 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-27 21:33:02,355 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-27 21:33:02,356 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-27 21:33:02,356 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-27 21:33:02,357 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-27 21:33:02,357 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-27 21:33:02,358 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-27 21:33:02,360 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-27 21:33:02,361 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-27 21:33:02,362 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-27 21:33:02,363 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-27 21:33:02,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-27 21:33:02,364 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-27 21:33:02,364 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-27 21:33:02,365 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-27 21:33:02,365 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-27 21:33:02,365 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-27 21:33:02,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825438410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:33:02,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:33:02,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-04-27 21:33:02,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735046896] [2022-04-27 21:33:02,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:33:02,368 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-27 21:33:02,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:02,369 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-27 21:33:02,402 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-27 21:33:02,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:33:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:33:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:33:02,405 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-27 21:33:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:02,892 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-27 21:33:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:33:02,892 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-27 21:33:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:02,893 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-27 21:33:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-27 21:33:02,895 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-27 21:33:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-27 21:33:02,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2022-04-27 21:33:02,964 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-27 21:33:02,972 INFO L225 Difference]: With dead ends: 58 [2022-04-27 21:33:02,972 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 21:33:02,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-27 21:33:02,976 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:33:02,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 41 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 101 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-04-27 21:33:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 21:33:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-04-27 21:33:02,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:02,998 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-27 21:33:02,998 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-27 21:33:03,000 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-27 21:33:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:03,003 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 21:33:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 21:33:03,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:03,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:03,004 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-27 21:33:03,005 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-27 21:33:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:03,012 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 21:33:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 21:33:03,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:03,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:03,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:03,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:03,017 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-27 21:33:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 21:33:03,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-27 21:33:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:03,019 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 21:33:03,019 INFO L496 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-27 21:33:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 21:33:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:33:03,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:03,020 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:03,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:33:03,246 WARN L477 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-27 21:33:03,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash 158933700, now seen corresponding path program 2 times [2022-04-27 21:33:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:03,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824593212] [2022-04-27 21:33:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:03,367 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-27 21:33:03,367 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-27 21:33:03,367 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-27 21:33:03,368 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-27 21:33:03,368 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-27 21:33:03,369 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-27 21:33:03,369 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-27 21:33:03,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-27 21:33:03,369 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-27 21:33:03,370 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-27 21:33:03,371 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-27 21:33:03,372 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-27 21:33:03,372 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-27 21:33:03,372 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-27 21:33:03,372 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-27 21:33:03,372 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-27 21:33:03,373 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-27 21:33:03,373 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-27 21:33:03,373 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-27 21:33:03,373 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-27 21:33:03,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:03,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824593212] [2022-04-27 21:33:03,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824593212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:33:03,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171789063] [2022-04-27 21:33:03,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:33:03,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:03,375 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-27 21:33:03,379 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-27 21:33:03,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:33:03,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:33:03,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 21:33:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:03,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:33:03,478 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-27 21:33:03,519 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 21:33:03,520 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-27 21:33:03,602 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-27 21:33:03,602 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-27 21:33:03,603 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-27 21:33:03,603 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-27 21:33:03,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-27 21:33:03,605 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-27 21:33:03,609 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-27 21:33:03,609 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-27 21:33:03,610 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-27 21:33:03,610 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-27 21:33:03,611 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-27 21:33:03,612 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-27 21:33:03,612 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-27 21:33:03,612 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-27 21:33:03,612 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-27 21:33:03,612 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-27 21:33:03,612 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-27 21:33:03,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:33:03,836 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-27 21:33:03,867 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-27 21:33:04,030 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-27 21:33:04,031 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-27 21:33:04,031 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-27 21:33:04,031 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-27 21:33:04,033 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-27 21:33:04,034 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-27 21:33:04,034 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-27 21:33:04,035 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-27 21:33:04,036 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-27 21:33:04,037 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-27 21:33:04,038 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-27 21:33:04,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-27 21:33:04,038 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-27 21:33:04,038 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-27 21:33:04,039 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-27 21:33:04,039 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-27 21:33:04,039 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-27 21:33:04,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171789063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:33:04,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:33:04,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-04-27 21:33:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602774130] [2022-04-27 21:33:04,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:33:04,040 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-27 21:33:04,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:04,041 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-27 21:33:04,067 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-27 21:33:04,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:33:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:33:04,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:33:04,068 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-27 21:33:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:04,798 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 21:33:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 21:33:04,798 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-27 21:33:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:04,799 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-27 21:33:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-27 21:33:04,802 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-27 21:33:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-27 21:33:04,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-04-27 21:33:04,864 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-27 21:33:04,866 INFO L225 Difference]: With dead ends: 66 [2022-04-27 21:33:04,867 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 21:33:04,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-04-27 21:33:04,868 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:33:04,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 192 Invalid, 0 Unknown, 1 Unchecked, 0.3s Time] [2022-04-27 21:33:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 21:33:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-04-27 21:33:04,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:04,890 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-27 21:33:04,890 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-27 21:33:04,891 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-27 21:33:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:04,898 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-27 21:33:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-27 21:33:04,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:04,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:04,901 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-27 21:33:04,902 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-27 21:33:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:04,906 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-27 21:33:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-27 21:33:04,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:04,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:04,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:04,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:04,912 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-27 21:33:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-27 21:33:04,914 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-27 21:33:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:04,914 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-27 21:33:04,914 INFO L496 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-27 21:33:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 21:33:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:33:04,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:04,915 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:04,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:33:05,123 WARN L477 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-27 21:33:05,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1178529856, now seen corresponding path program 3 times [2022-04-27 21:33:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352506062] [2022-04-27 21:33:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:05,238 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-27 21:33:05,238 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-27 21:33:05,238 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-27 21:33:05,239 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-27 21:33:05,239 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-27 21:33:05,239 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-27 21:33:05,240 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-27 21:33:05,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-27 21:33:05,240 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-27 21:33:05,241 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-27 21:33:05,242 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-27 21:33:05,242 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-27 21:33:05,243 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-27 21:33:05,243 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-27 21:33:05,243 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-27 21:33:05,243 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-27 21:33:05,244 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-27 21:33:05,244 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-27 21:33:05,244 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-27 21:33:05,244 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-27 21:33:05,244 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-27 21:33:05,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352506062] [2022-04-27 21:33:05,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352506062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:33:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936829295] [2022-04-27 21:33:05,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:33:05,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:05,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:05,246 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-27 21:33:05,274 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-27 21:33:05,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 21:33:05,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:33:05,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 21:33:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:05,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:33:05,535 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-27 21:33:05,536 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-27 21:33:05,536 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-27 21:33:05,536 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-27 21:33:05,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-27 21:33:05,536 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-27 21:33:05,537 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-27 21:33:05,538 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-27 21:33:05,538 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-27 21:33:05,540 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-27 21:33:05,540 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-27 21:33:05,540 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-27 21:33:05,541 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-27 21:33:05,541 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-27 21:33:05,541 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-27 21:33:05,541 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-27 21:33:05,541 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-27 21:33:05,541 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-27 21:33:05,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:33:05,657 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-27 21:33:05,657 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-27 21:33:05,657 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-27 21:33:05,657 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-27 21:33:05,657 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-27 21:33:05,658 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-27 21:33:05,658 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-27 21:33:05,658 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-27 21:33:05,659 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-27 21:33:05,660 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-27 21:33:05,661 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-27 21:33:05,662 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-27 21:33:05,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#true} is VALID [2022-04-27 21:33:05,662 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-27 21:33:05,662 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-27 21:33:05,662 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-27 21:33:05,662 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-27 21:33:05,662 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-27 21:33:05,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936829295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:33:05,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:33:05,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-27 21:33:05,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949069395] [2022-04-27 21:33:05,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:33:05,664 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-27 21:33:05,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:05,664 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-27 21:33:05,689 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-27 21:33:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:33:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:33:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:33:05,691 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-27 21:33:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:06,677 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2022-04-27 21:33:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 21:33:06,677 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-27 21:33:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:06,678 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-27 21:33:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-27 21:33:06,681 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-27 21:33:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-27 21:33:06,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2022-04-27 21:33:06,791 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-27 21:33:06,793 INFO L225 Difference]: With dead ends: 92 [2022-04-27 21:33:06,793 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 21:33:06,794 INFO L412 NwaCegarLoop]: 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-27 21:33:06,794 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-27 21:33:06,794 INFO L414 NwaCegarLoop]: 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-27 21:33:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 21:33:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 32. [2022-04-27 21:33:06,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:06,828 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-27 21:33:06,828 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-27 21:33:06,828 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-27 21:33:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:06,832 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2022-04-27 21:33:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-27 21:33:06,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:06,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:06,833 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-27 21:33:06,833 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-27 21:33:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:06,837 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2022-04-27 21:33:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-27 21:33:06,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:06,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:06,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:06,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:06,838 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-27 21:33:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-27 21:33:06,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2022-04-27 21:33:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:06,839 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-27 21:33:06,839 INFO L496 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-27 21:33:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:33:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:33:06,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:06,840 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:06,865 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-27 21:33:07,053 WARN L477 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-27 21:33:07,053 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 815042884, now seen corresponding path program 4 times [2022-04-27 21:33:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:07,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544226847] [2022-04-27 21:33:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:07,240 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-27 21:33:07,240 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-27 21:33:07,241 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-27 21:33:07,241 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-27 21:33:07,242 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-27 21:33:07,242 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-27 21:33:07,242 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-27 21:33:07,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-27 21:33:07,243 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-27 21:33:07,244 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-27 21:33:07,245 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-27 21:33:07,247 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-27 21:33:07,247 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-27 21:33:07,248 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-27 21:33:07,249 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-27 21:33:07,250 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-27 21:33:07,250 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-27 21:33:07,251 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-27 21:33:07,251 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-27 21:33:07,251 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-27 21:33:07,251 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-27 21:33:07,252 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-27 21:33:07,252 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-27 21:33:07,252 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-27 21:33:07,252 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-27 21:33:07,252 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-27 21:33:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544226847] [2022-04-27 21:33:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544226847] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:33:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397504915] [2022-04-27 21:33:07,253 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 21:33:07,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:07,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:07,256 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-27 21:33:07,282 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-27 21:33:07,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 21:33:07,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:33:07,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 21:33:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:07,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:33:07,397 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-27 21:33:07,448 INFO L356 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2022-04-27 21:33:07,448 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-27 21:33:07,491 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 21:33:07,492 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-27 21:33:07,540 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 21:33:07,540 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-27 21:33:07,590 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-04-27 21:33:07,590 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-27 21:33:07,642 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 21:33:07,643 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-27 21:33:07,683 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 21:33:07,684 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-27 21:33:07,726 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 21:33:07,727 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-27 21:33:07,812 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-27 21:33:07,812 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-27 21:33:07,813 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-27 21:33:07,813 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-27 21:33:07,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#true} is VALID [2022-04-27 21:33:07,814 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-27 21:33:07,815 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-27 21:33:07,816 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-27 21:33:07,817 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-27 21:33:07,818 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-27 21:33:07,818 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-27 21:33:07,819 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-27 21:33:07,820 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-27 21:33:07,821 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-27 21:33:07,821 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-27 21:33:07,821 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-27 21:33:07,822 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-27 21:33:07,822 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-27 21:33:07,823 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-27 21:33:07,823 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-27 21:33:07,824 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-27 21:33:07,824 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-27 21:33:07,825 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-27 21:33:07,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:33:11,272 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-27 21:33:12,058 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