/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:59:25,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:59:25,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:59:25,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:59:25,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:59:25,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:59:25,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:59:25,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:59:25,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:59:25,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:59:25,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:59:25,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:59:25,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:59:25,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:59:25,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:59:25,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:59:25,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:59:25,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:59:25,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:59:25,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:59:25,665 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:59:25,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:59:25,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:59:25,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:59:25,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:59:25,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:59:25,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:59:25,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:59:25,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:59:25,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:59:25,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:59:25,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:59:25,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:59:25,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:59:25,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:59:25,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:59:25,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:59:25,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:59:25,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:59:25,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:59:25,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:59:25,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:59:25,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 21:59:25,708 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:59:25,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:59:25,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 21:59:25,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 21:59:25,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 21:59:25,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 21:59:25,710 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 21:59:25,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:59:25,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:59:25,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:59:25,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:59:25,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 21:59:25,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 21:59:25,713 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:59:25,713 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 21:59:25,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:59:25,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:59:25,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:59:25,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:59:25,920 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:59:25,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2022-04-07 21:59:25,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf729192/ea5326b3ba7840819cd5021101ede9c0/FLAGf84daddb2 [2022-04-07 21:59:26,433 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:59:26,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2022-04-07 21:59:26,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf729192/ea5326b3ba7840819cd5021101ede9c0/FLAGf84daddb2 [2022-04-07 21:59:26,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf729192/ea5326b3ba7840819cd5021101ede9c0 [2022-04-07 21:59:26,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:59:26,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:59:26,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:59:26,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:59:26,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:59:26,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:59:26" (1/1) ... [2022-04-07 21:59:26,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec155f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:26, skipping insertion in model container [2022-04-07 21:59:26,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:59:26" (1/1) ... [2022-04-07 21:59:26,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:59:26,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:59:27,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c[352,365] [2022-04-07 21:59:27,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:59:27,133 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:59:27,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c[352,365] [2022-04-07 21:59:27,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:59:27,155 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:59:27,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27 WrapperNode [2022-04-07 21:59:27,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:59:27,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:59:27,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:59:27,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:59:27,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:59:27,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:59:27,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:59:27,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:59:27,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:59:27,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:27,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 21:59:27,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 21:59:27,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:59:27,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:59:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:59:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 21:59:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:59:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:59:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:59:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:59:27,330 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:59:27,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:59:27,455 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:59:27,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:59:27,460 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 21:59:27,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:27 BoogieIcfgContainer [2022-04-07 21:59:27,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:59:27,462 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:59:27,462 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:59:27,463 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:59:27,465 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,466 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 21:59:27,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:59:27 BasicIcfg [2022-04-07 21:59:27,486 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:59:27,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:59:27,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:59:27,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:59:27,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:59:26" (1/4) ... [2022-04-07 21:59:27,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70046435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (2/4) ... [2022-04-07 21:59:27,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70046435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:27" (3/4) ... [2022-04-07 21:59:27,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70046435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:59:27" (4/4) ... [2022-04-07 21:59:27,491 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-1.cqvasr [2022-04-07 21:59:27,494 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:59:27,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:59:27,522 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:59:27,527 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 21:59:27,527 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:59:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 21:59:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 21:59:27,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:27,543 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:27,544 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1459888189, now seen corresponding path program 1 times [2022-04-07 21:59:27,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:27,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122392766] [2022-04-07 21:59:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:27,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-07 21:59:27,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 21:59:27,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 21:59:27,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:27,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-07 21:59:27,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 21:59:27,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 21:59:27,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 21:59:27,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {32#true} is VALID [2022-04-07 21:59:27,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} [83] L17-->L17-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-07 21:59:27,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {33#false} is VALID [2022-04-07 21:59:27,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} [86] L22-3-->L22-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-07 21:59:27,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {33#false} is VALID [2022-04-07 21:59:27,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} [91] L29-3-->L29-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-07 21:59:27,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {33#false} is VALID [2022-04-07 21:59:27,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {33#false} is VALID [2022-04-07 21:59:27,781 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {33#false} is VALID [2022-04-07 21:59:27,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [103] __VERIFIER_assertENTRY-->L7: 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] {33#false} is VALID [2022-04-07 21:59:27,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} [105] L7-->L8: 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[] {33#false} is VALID [2022-04-07 21:59:27,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-07 21:59:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:27,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:27,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122392766] [2022-04-07 21:59:27,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122392766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:27,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:27,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 21:59:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152758706] [2022-04-07 21:59:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 21:59:27,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:27,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:27,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:27,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 21:59:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 21:59:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 21:59:27,842 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:27,936 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-07 21:59:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 21:59:27,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 21:59:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-07 21:59:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-07 21:59:27,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-07 21:59:28,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:28,029 INFO L225 Difference]: With dead ends: 51 [2022-04-07 21:59:28,029 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 21:59:28,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 21:59:28,035 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:28,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:59:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 21:59:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 21:59:28,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:28,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,059 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,060 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,064 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 21:59:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 21:59:28,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 24 states. [2022-04-07 21:59:28,065 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 24 states. [2022-04-07 21:59:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,068 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 21:59:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 21:59:28,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:28,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-07 21:59:28,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-07 21:59:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:28,082 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-07 21:59:28,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 21:59:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 21:59:28,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:28,085 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:28,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:59:28,086 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1257013952, now seen corresponding path program 1 times [2022-04-07 21:59:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:28,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994657038] [2022-04-07 21:59:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {186#true} is VALID [2022-04-07 21:59:28,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-07 21:59:28,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-07 21:59:28,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:28,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {186#true} is VALID [2022-04-07 21:59:28,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-07 21:59:28,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-07 21:59:28,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-07 21:59:28,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {186#true} is VALID [2022-04-07 21:59:28,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {191#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:28,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#(<= 1 main_~MAX~0)} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {192#(and (<= 1 main_~MAX~0) (= main_~i~0 0))} is VALID [2022-04-07 21:59:28,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#(and (<= 1 main_~MAX~0) (= main_~i~0 0))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-07 21:59:28,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#false} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {187#false} is VALID [2022-04-07 21:59:28,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#false} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-07 21:59:28,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {187#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {187#false} is VALID [2022-04-07 21:59:28,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {187#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {187#false} is VALID [2022-04-07 21:59:28,234 INFO L272 TraceCheckUtils]: 13: Hoare triple {187#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {187#false} is VALID [2022-04-07 21:59:28,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {187#false} [103] __VERIFIER_assertENTRY-->L7: 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] {187#false} is VALID [2022-04-07 21:59:28,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {187#false} [105] L7-->L8: 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[] {187#false} is VALID [2022-04-07 21:59:28,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-07 21:59:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:28,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994657038] [2022-04-07 21:59:28,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994657038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:28,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:28,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 21:59:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186689507] [2022-04-07 21:59:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 21:59:28,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:28,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:28,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:59:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:28,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:59:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:59:28,314 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,430 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-07 21:59:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 21:59:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 21:59:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-07 21:59:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-07 21:59:28,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-07 21:59:28,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:28,471 INFO L225 Difference]: With dead ends: 44 [2022-04-07 21:59:28,471 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 21:59:28,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-07 21:59:28,472 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:28,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:59:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 21:59:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-07 21:59:28,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:28,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,479 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,480 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,481 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 21:59:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 21:59:28,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 30 states. [2022-04-07 21:59:28,482 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 30 states. [2022-04-07 21:59:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,483 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 21:59:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 21:59:28,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:28,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-07 21:59:28,485 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2022-04-07 21:59:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:28,485 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-07 21:59:28,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-07 21:59:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:59:28,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:28,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:28,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:59:28,486 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:28,486 INFO L85 PathProgramCache]: Analyzing trace with hash 313528638, now seen corresponding path program 1 times [2022-04-07 21:59:28,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:28,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160071314] [2022-04-07 21:59:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {355#true} is VALID [2022-04-07 21:59:28,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-07 21:59:28,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {355#true} {355#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-07 21:59:28,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {355#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:28,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {355#true} is VALID [2022-04-07 21:59:28,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-07 21:59:28,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-07 21:59:28,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-07 21:59:28,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {355#true} is VALID [2022-04-07 21:59:28,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {355#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {360#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:28,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(<= 1 main_~MAX~0)} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {360#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:28,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#(<= 1 main_~MAX~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {360#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:28,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {360#(<= 1 main_~MAX~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {360#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:28,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {360#(<= 1 main_~MAX~0)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {360#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:28,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {360#(<= 1 main_~MAX~0)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {361#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:28,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#(<= 0 main_~i~0)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {356#false} is VALID [2022-04-07 21:59:28,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {356#false} is VALID [2022-04-07 21:59:28,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {356#false} is VALID [2022-04-07 21:59:28,575 INFO L272 TraceCheckUtils]: 15: Hoare triple {356#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {356#false} is VALID [2022-04-07 21:59:28,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#false} [103] __VERIFIER_assertENTRY-->L7: 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] {356#false} is VALID [2022-04-07 21:59:28,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {356#false} [105] L7-->L8: 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[] {356#false} is VALID [2022-04-07 21:59:28,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {356#false} is VALID [2022-04-07 21:59:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 21:59:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:28,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160071314] [2022-04-07 21:59:28,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160071314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:28,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:28,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 21:59:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687823554] [2022-04-07 21:59:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:28,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2022-04-07 21:59:28,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:28,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:28,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:59:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:28,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:59:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:59:28,591 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,696 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-07 21:59:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 21:59:28,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2022-04-07 21:59:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-07 21:59:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-07 21:59:28,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-07 21:59:28,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:28,730 INFO L225 Difference]: With dead ends: 37 [2022-04-07 21:59:28,730 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 21:59:28,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-07 21:59:28,731 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:28,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:59:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 21:59:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 21:59:28,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:28,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,741 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,741 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,742 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 21:59:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 21:59:28,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-07 21:59:28,743 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-07 21:59:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,744 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 21:59:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 21:59:28,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:28,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:59:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-07 21:59:28,745 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-04-07 21:59:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:28,745 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-07 21:59:28,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 21:59:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 21:59:28,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:28,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:28,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:59:28,746 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash -617930468, now seen corresponding path program 1 times [2022-04-07 21:59:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:28,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341332268] [2022-04-07 21:59:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {509#true} is VALID [2022-04-07 21:59:29,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {509#true} {509#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:29,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {509#true} is VALID [2022-04-07 21:59:29,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {509#true} is VALID [2022-04-07 21:59:29,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {514#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:29,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(<= 1 main_~MAX~0)} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {515#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {515#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {515#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {516#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {517#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {518#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {518#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {520#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 |main_~#str2~0.offset|) 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {520#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 |main_~#str2~0.offset|) 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {521#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:29,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {521#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {522#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 21:59:29,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(not (= |__VERIFIER_assert_#in~cond| 0))} [103] __VERIFIER_assertENTRY-->L7: 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] {523#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 21:59:29,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {523#(not (= __VERIFIER_assert_~cond 0))} [105] L7-->L8: 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[] {510#false} is VALID [2022-04-07 21:59:29,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {510#false} is VALID [2022-04-07 21:59:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:29,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341332268] [2022-04-07 21:59:29,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341332268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:29,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093189711] [2022-04-07 21:59:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:29,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:59:29,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 21:59:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 21:59:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:59:29,237 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 10 treesize of output 8 [2022-04-07 21:59:29,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-04-07 21:59:29,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-04-07 21:59:29,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {509#true} is VALID [2022-04-07 21:59:29,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:29,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {509#true} is VALID [2022-04-07 21:59:29,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {514#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:29,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(<= 1 main_~MAX~0)} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {549#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {549#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~i~0 0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {516#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {517#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {518#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {518#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:29,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(and (= |main_~#str2~0.offset| 0) (<= 1 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 1))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {520#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 |main_~#str2~0.offset|) 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:29,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {520#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= (+ main_~j~0 |main_~#str2~0.offset|) 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {521#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:29,640 INFO L272 TraceCheckUtils]: 17: Hoare triple {521#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:59:29,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __VERIFIER_assertENTRY-->L7: 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] {584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:59:29,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {584#(<= 1 __VERIFIER_assert_~cond)} [105] L7-->L8: 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[] {510#false} is VALID [2022-04-07 21:59:29,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {510#false} is VALID [2022-04-07 21:59:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:29,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:59:29,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-07 21:59:29,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-04-07 21:59:29,754 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 29 treesize of output 24 [2022-04-07 21:59:29,770 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-04-07 21:59:29,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2022-04-07 21:59:30,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {510#false} is VALID [2022-04-07 21:59:30,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {584#(<= 1 __VERIFIER_assert_~cond)} [105] L7-->L8: 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[] {510#false} is VALID [2022-04-07 21:59:30,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __VERIFIER_assertENTRY-->L7: 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] {584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:59:30,039 INFO L272 TraceCheckUtils]: 17: Hoare triple {521#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:59:30,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {521#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:30,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {607#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {603#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:30,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {607#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-07 21:59:30,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {607#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-07 21:59:30,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {617#(and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 (+ main_~j~0 1))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 (+ main_~j~0 1))))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {607#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-07 21:59:30,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#(and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1)))} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {617#(and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 (+ main_~j~0 1))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 (+ main_~j~0 1))))} is VALID [2022-04-07 21:59:30,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#(or (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))) (< main_~i~0 main_~MAX~0))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {621#(and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1)))} is VALID [2022-04-07 21:59:30,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {625#(or (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))) (< main_~i~0 main_~MAX~0))} is VALID [2022-04-07 21:59:30,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {629#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {629#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-07 21:59:30,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(<= 1 main_~MAX~0)} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {629#(or (< (+ main_~i~0 1) main_~MAX~0) (and (or (= (+ main_~MAX~0 |main_~#str2~0.offset|) (+ |main_~#str1~0.offset| 1)) (= main_~MAX~0 1)) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= main_~MAX~0 1))))} is VALID [2022-04-07 21:59:30,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {514#(<= 1 main_~MAX~0)} is VALID [2022-04-07 21:59:30,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {509#true} is VALID [2022-04-07 21:59:30,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:30,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:30,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:30,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {509#true} is VALID [2022-04-07 21:59:30,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#true} is VALID [2022-04-07 21:59:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:30,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093189711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:59:30,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 21:59:30,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-04-07 21:59:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91423549] [2022-04-07 21:59:30,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 21:59:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:59:30,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:30,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:30,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:30,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 21:59:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 21:59:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-07 21:59:30,106 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:31,150 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-07 21:59:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-07 21:59:31,150 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:59:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 60 transitions. [2022-04-07 21:59:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 60 transitions. [2022-04-07 21:59:31,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 60 transitions. [2022-04-07 21:59:31,208 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-07 21:59:31,210 INFO L225 Difference]: With dead ends: 54 [2022-04-07 21:59:31,210 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 21:59:31,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2022-04-07 21:59:31,211 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:31,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 56 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 21:59:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 21:59:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2022-04-07 21:59:31,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:31,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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-07 21:59:31,233 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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-07 21:59:31,233 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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-07 21:59:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:31,235 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-07 21:59:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-07 21:59:31,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:31,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:31,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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 52 states. [2022-04-07 21:59:31,236 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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 52 states. [2022-04-07 21:59:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:31,238 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-07 21:59:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-07 21:59:31,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:31,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:31,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:31,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 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-07 21:59:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-07 21:59:31,240 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2022-04-07 21:59:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:31,240 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-07 21:59:31,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-07 21:59:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 21:59:31,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:31,241 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:31,260 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-07 21:59:31,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:31,455 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash 809600538, now seen corresponding path program 2 times [2022-04-07 21:59:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:31,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245357287] [2022-04-07 21:59:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:31,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {927#true} is VALID [2022-04-07 21:59:31,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {927#true} {927#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {927#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:31,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {927#true} is VALID [2022-04-07 21:59:31,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {927#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {927#true} {927#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {927#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {927#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {927#true} is VALID [2022-04-07 21:59:31,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {927#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {927#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {932#(= main_~i~0 0)} is VALID [2022-04-07 21:59:31,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {932#(= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {932#(= main_~i~0 0)} is VALID [2022-04-07 21:59:31,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#(= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(<= 1 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(<= 2 main_~MAX~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#(<= 2 main_~MAX~0)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {934#(<= 2 main_~MAX~0)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(<= 1 main_~i~0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(<= 1 main_~i~0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#(<= 0 main_~i~0)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {928#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {928#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L272 TraceCheckUtils]: 19: Hoare triple {928#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {928#false} [103] __VERIFIER_assertENTRY-->L7: 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] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {928#false} [105] L7-->L8: 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[] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {928#false} is VALID [2022-04-07 21:59:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:31,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245357287] [2022-04-07 21:59:31,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245357287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:31,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462528613] [2022-04-07 21:59:31,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 21:59:31,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:31,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:31,583 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-07 21:59:31,596 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-07 21:59:31,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 21:59:31,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 21:59:31,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 21:59:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:31,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:59:31,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {927#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {927#true} is VALID [2022-04-07 21:59:31,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {927#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {927#true} {927#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {927#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {927#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {927#true} is VALID [2022-04-07 21:59:31,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {927#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {927#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {935#(<= 0 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(<= 0 main_~i~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(<= 1 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(<= 2 main_~MAX~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#(<= 2 main_~MAX~0)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {934#(<= 2 main_~MAX~0)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(<= 1 main_~i~0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(<= 1 main_~i~0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#(<= 0 main_~i~0)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {928#false} is VALID [2022-04-07 21:59:31,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {928#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {928#false} is VALID [2022-04-07 21:59:31,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {928#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {928#false} is VALID [2022-04-07 21:59:31,796 INFO L272 TraceCheckUtils]: 19: Hoare triple {928#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {928#false} is VALID [2022-04-07 21:59:31,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {928#false} [103] __VERIFIER_assertENTRY-->L7: 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] {928#false} is VALID [2022-04-07 21:59:31,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {928#false} [105] L7-->L8: 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[] {928#false} is VALID [2022-04-07 21:59:31,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {928#false} is VALID [2022-04-07 21:59:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:31,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:59:31,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {928#false} is VALID [2022-04-07 21:59:31,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {928#false} [105] L7-->L8: 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[] {928#false} is VALID [2022-04-07 21:59:31,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {928#false} [103] __VERIFIER_assertENTRY-->L7: 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] {928#false} is VALID [2022-04-07 21:59:31,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {928#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {928#false} is VALID [2022-04-07 21:59:31,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {928#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {928#false} is VALID [2022-04-07 21:59:31,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {928#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {928#false} is VALID [2022-04-07 21:59:31,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#(<= 0 main_~i~0)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {928#false} is VALID [2022-04-07 21:59:31,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(<= 1 main_~i~0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(<= 1 main_~i~0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {934#(<= 2 main_~MAX~0)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#(<= 2 main_~MAX~0)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(<= 2 main_~MAX~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(<= 1 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {934#(<= 2 main_~MAX~0)} is VALID [2022-04-07 21:59:31,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(<= 0 main_~i~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {933#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:31,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {935#(<= 0 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {927#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {935#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:31,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {927#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {927#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {927#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {927#true} {927#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {927#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {927#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#true} is VALID [2022-04-07 21:59:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:31,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462528613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:59:31,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 21:59:31,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-04-07 21:59:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681563725] [2022-04-07 21:59:31,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 21:59:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 23 [2022-04-07 21:59:31,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:31,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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-07 21:59:31,910 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-07 21:59:31,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 21:59:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 21:59:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 21:59:31,911 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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-07 21:59:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:32,218 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-04-07 21:59:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 21:59:32,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 23 [2022-04-07 21:59:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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-07 21:59:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-07 21:59:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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-07 21:59:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-07 21:59:32,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-07 21:59:32,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:32,262 INFO L225 Difference]: With dead ends: 59 [2022-04-07 21:59:32,262 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 21:59:32,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-07 21:59:32,264 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:32,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 46 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:59:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 21:59:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-07 21:59:32,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:32,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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-07 21:59:32,300 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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-07 21:59:32,300 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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-07 21:59:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:32,302 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-07 21:59:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-07 21:59:32,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:32,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:32,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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 48 states. [2022-04-07 21:59:32,303 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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 48 states. [2022-04-07 21:59:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:32,304 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-07 21:59:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-07 21:59:32,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:32,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:32,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:32,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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-07 21:59:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-07 21:59:32,306 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2022-04-07 21:59:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:32,306 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-07 21:59:32,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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-07 21:59:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 21:59:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:59:32,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:32,307 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:32,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 21:59:32,523 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:32,524 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -634204424, now seen corresponding path program 3 times [2022-04-07 21:59:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:32,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432771035] [2022-04-07 21:59:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:32,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {1343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1326#true} is VALID [2022-04-07 21:59:32,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:32,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1326#true} {1326#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:32,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:32,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1326#true} is VALID [2022-04-07 21:59:32,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:32,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:32,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:32,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {1326#true} is VALID [2022-04-07 21:59:32,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:32,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {1331#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:32,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1331#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1331#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:32,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1331#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1332#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} is VALID [2022-04-07 21:59:32,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {1332#(and (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 1 main_~i~0))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1333#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:32,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {1333#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1334#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-07 21:59:32,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {1335#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:32,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {1335#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {1336#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:32,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {1336#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1337#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} is VALID [2022-04-07 21:59:32,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1337#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} is VALID [2022-04-07 21:59:32,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {1337#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (<= main_~j~0 1))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1338#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:32,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {1338#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1338#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:32,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {1338#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1338#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:32,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {1338#(and (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2) (= (select (select |#memory_int| |main_~#str2~0.base|) 1) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1339#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1))} is VALID [2022-04-07 21:59:32,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {1339#(and (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|))) (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset|) 1))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {1340#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:32,982 INFO L272 TraceCheckUtils]: 21: Hoare triple {1340#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {1341#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 21:59:32,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(not (= |__VERIFIER_assert_#in~cond| 0))} [103] __VERIFIER_assertENTRY-->L7: 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] {1342#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 21:59:32,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {1342#(not (= __VERIFIER_assert_~cond 0))} [105] L7-->L8: 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[] {1327#false} is VALID [2022-04-07 21:59:32,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {1327#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1327#false} is VALID [2022-04-07 21:59:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:32,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:32,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432771035] [2022-04-07 21:59:32,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432771035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:32,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189679036] [2022-04-07 21:59:32,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 21:59:32,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:32,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:32,986 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-07 21:59:32,992 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-07 21:59:33,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 21:59:33,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 21:59:33,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 21:59:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:33,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:59:33,080 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 10 treesize of output 8 [2022-04-07 21:59:33,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-07 21:59:33,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-07 21:59:33,627 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-07 21:59:33,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-04-07 21:59:33,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:33,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1326#true} is VALID [2022-04-07 21:59:33,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:33,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:33,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:33,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {1326#true} is VALID [2022-04-07 21:59:33,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:33,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {1368#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:33,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1368#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1368#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:33,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {1368#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1375#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 21:59:33,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {1375#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1379#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 main_~MAX~0))} is VALID [2022-04-07 21:59:33,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 main_~MAX~0))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1383#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} is VALID [2022-04-07 21:59:33,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {1383#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~i~0 2))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {1387#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {1387#(and (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {1391#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1391#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1395#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1395#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1395#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {1395#(and (= main_~j~0 1) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1402#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {1402#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1402#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {1402#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1402#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} is VALID [2022-04-07 21:59:33,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {1402#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 2))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1412#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 0 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1))} is VALID [2022-04-07 21:59:33,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {1412#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< 0 main_~j~0) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 1))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {1340#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:33,723 INFO L272 TraceCheckUtils]: 21: Hoare triple {1340#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {1419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:59:33,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {1419#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __VERIFIER_assertENTRY-->L7: 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] {1423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:59:33,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {1423#(<= 1 __VERIFIER_assert_~cond)} [105] L7-->L8: 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[] {1327#false} is VALID [2022-04-07 21:59:33,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {1327#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1327#false} is VALID [2022-04-07 21:59:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:33,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:59:35,117 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 128 treesize of output 108 [2022-04-07 21:59:35,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-07 21:59:35,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 179 [2022-04-07 21:59:35,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {1327#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1327#false} is VALID [2022-04-07 21:59:35,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {1423#(<= 1 __VERIFIER_assert_~cond)} [105] L7-->L8: 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[] {1327#false} is VALID [2022-04-07 21:59:35,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {1419#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __VERIFIER_assertENTRY-->L7: 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] {1423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:59:35,523 INFO L272 TraceCheckUtils]: 21: Hoare triple {1340#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {1419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:59:35,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1442#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {1340#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:35,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1442#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:35,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {1446#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1446#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-07 21:59:35,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {1446#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1446#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-07 21:59:36,092 WARN L290 TraceCheckUtils]: 16: Hoare triple {1456#(forall ((|main_~#str2~0.offset| Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1446#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is UNKNOWN [2022-04-07 21:59:36,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {1456#(forall ((|main_~#str2~0.offset| Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1456#(forall ((|main_~#str2~0.offset| Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:36,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1463#(= main_~MAX~0 (+ main_~j~0 2))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1456#(forall ((|main_~#str2~0.offset| Int)) (= (select (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) |main_~#str1~0.base|) |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:36,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {1467#(= main_~MAX~0 2)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {1463#(= main_~MAX~0 (+ main_~j~0 2))} is VALID [2022-04-07 21:59:36,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1471#(or (= main_~MAX~0 2) (< main_~i~0 main_~MAX~0))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {1467#(= main_~MAX~0 2)} is VALID [2022-04-07 21:59:36,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {1475#(or (< (+ main_~i~0 1) main_~MAX~0) (= main_~MAX~0 2))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1471#(or (= main_~MAX~0 2) (< main_~i~0 main_~MAX~0))} is VALID [2022-04-07 21:59:36,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {1479#(and (<= main_~i~0 1) (<= 1 main_~i~0))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1475#(or (< (+ main_~i~0 1) main_~MAX~0) (= main_~MAX~0 2))} is VALID [2022-04-07 21:59:36,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1483#(and (<= main_~i~0 0) (<= 0 main_~i~0))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1479#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-07 21:59:36,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {1483#(and (<= main_~i~0 0) (<= 0 main_~i~0))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1483#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-07 21:59:36,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {1483#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-07 21:59:36,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:36,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {1326#true} is VALID [2022-04-07 21:59:36,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:36,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:36,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:36,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1326#true} is VALID [2022-04-07 21:59:36,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-07 21:59:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:36,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189679036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:59:36,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 21:59:36,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2022-04-07 21:59:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234708952] [2022-04-07 21:59:36,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 21:59:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:59:36,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:36,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:36,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:36,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-07 21:59:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-07 21:59:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1047, Unknown=2, NotChecked=0, Total=1190 [2022-04-07 21:59:36,635 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:39,006 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-04-07 21:59:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-07 21:59:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:59:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-07 21:59:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-07 21:59:39,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 77 transitions. [2022-04-07 21:59:39,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:39,099 INFO L225 Difference]: With dead ends: 80 [2022-04-07 21:59:39,099 INFO L226 Difference]: Without dead ends: 78 [2022-04-07 21:59:39,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=560, Invalid=3098, Unknown=2, NotChecked=0, Total=3660 [2022-04-07 21:59:39,101 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 72 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:39,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 113 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 856 Invalid, 0 Unknown, 48 Unchecked, 0.8s Time] [2022-04-07 21:59:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-07 21:59:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2022-04-07 21:59:39,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:39,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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-07 21:59:39,148 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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-07 21:59:39,148 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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-07 21:59:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:39,150 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-04-07 21:59:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-04-07 21:59:39,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:39,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:39,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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 78 states. [2022-04-07 21:59:39,151 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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 78 states. [2022-04-07 21:59:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:39,152 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-04-07 21:59:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-04-07 21:59:39,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:39,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:39,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:39,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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-07 21:59:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-07 21:59:39,154 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 25 [2022-04-07 21:59:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:39,154 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-07 21:59:39,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-07 21:59:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 21:59:39,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:39,155 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:39,172 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-07 21:59:39,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:39,372 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1131578614, now seen corresponding path program 4 times [2022-04-07 21:59:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612057797] [2022-04-07 21:59:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:39,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1901#true} is VALID [2022-04-07 21:59:39,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:39,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1901#true} {1901#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:39,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {1901#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:39,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1901#true} is VALID [2022-04-07 21:59:39,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {1901#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:39,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1901#true} {1901#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:39,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {1901#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:39,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {1901#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {1901#true} is VALID [2022-04-07 21:59:39,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {1901#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:39,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1901#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {1906#(= main_~i~0 0)} is VALID [2022-04-07 21:59:39,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1906#(= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1906#(= main_~i~0 0)} is VALID [2022-04-07 21:59:39,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {1906#(= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1907#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:39,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#(<= 1 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1907#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:39,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#(<= 1 main_~i~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1908#(<= 2 main_~i~0)} is VALID [2022-04-07 21:59:39,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {1908#(<= 2 main_~i~0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1909#(<= 3 main_~MAX~0)} is VALID [2022-04-07 21:59:39,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {1909#(<= 3 main_~MAX~0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1909#(<= 3 main_~MAX~0)} is VALID [2022-04-07 21:59:39,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(<= 3 main_~MAX~0)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {1909#(<= 3 main_~MAX~0)} is VALID [2022-04-07 21:59:39,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {1909#(<= 3 main_~MAX~0)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {1908#(<= 2 main_~i~0)} is VALID [2022-04-07 21:59:39,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {1908#(<= 2 main_~i~0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1908#(<= 2 main_~i~0)} is VALID [2022-04-07 21:59:39,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {1908#(<= 2 main_~i~0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1907#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:39,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {1907#(<= 1 main_~i~0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1907#(<= 1 main_~i~0)} is VALID [2022-04-07 21:59:39,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {1907#(<= 1 main_~i~0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1910#(<= 0 main_~i~0)} is VALID [2022-04-07 21:59:39,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {1910#(<= 0 main_~i~0)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {1902#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {1902#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L272 TraceCheckUtils]: 23: Hoare triple {1902#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {1902#false} [103] __VERIFIER_assertENTRY-->L7: 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] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {1902#false} [105] L7-->L8: 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[] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {1902#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#false} is VALID [2022-04-07 21:59:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:39,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612057797] [2022-04-07 21:59:39,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612057797] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130728943] [2022-04-07 21:59:39,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 21:59:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:39,480 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-07 21:59:39,504 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-07 21:59:39,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 21:59:39,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 21:59:39,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-07 21:59:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:39,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:59:39,578 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 10 treesize of output 8 [2022-04-07 21:59:39,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-07 21:59:39,996 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-07 21:59:39,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-04-07 21:59:40,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {1901#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1901#true} is VALID [2022-04-07 21:59:40,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {1901#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1901#true} {1901#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1901#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {1901#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {1901#true} is VALID [2022-04-07 21:59:40,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {1901#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {1901#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {1936#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {1961#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (= main_~i~0 (+ (- 1) main_~MAX~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {1961#(and (= |main_~#str1~0.offset| 0) (= main_~j~0 0) (= main_~i~0 (+ (- 1) main_~MAX~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1965#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 (+ (- 1) main_~MAX~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {1965#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (= main_~i~0 (+ (- 1) main_~MAX~0)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1969#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~MAX~0) (+ main_~i~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {1969#(and (= (+ (- 1) main_~j~0) 0) (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~MAX~0) (+ main_~i~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {1973#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~MAX~0) (+ main_~i~0 1)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {1973#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (= (+ (- 1) main_~MAX~0) (+ main_~i~0 1)) (<= 0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {1977#(and (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= main_~MAX~0 (+ main_~i~0 3)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {1977#(and (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= main_~MAX~0 (+ main_~i~0 3)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1981#(and (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< main_~MAX~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {1981#(and (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= |main_~#str1~0.offset| 0) (< main_~MAX~0 3) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1985#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (< main_~j~0 2) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2022-04-07 21:59:40,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {1985#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= 1 main_~j~0) (= |main_~#str1~0.offset| 0) (< main_~j~0 2) (= main_~i~0 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {1989#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:40,096 INFO L272 TraceCheckUtils]: 23: Hoare triple {1989#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {1993#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:59:40,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __VERIFIER_assertENTRY-->L7: 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] {1997#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:59:40,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {1997#(<= 1 __VERIFIER_assert_~cond)} [105] L7-->L8: 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[] {1902#false} is VALID [2022-04-07 21:59:40,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {1902#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#false} is VALID [2022-04-07 21:59:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-07 21:59:40,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:59:40,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-07 21:59:40,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-04-07 21:59:40,264 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-04-07 21:59:40,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2022-04-07 21:59:40,281 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 29 treesize of output 24 [2022-04-07 21:59:40,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {1902#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#false} is VALID [2022-04-07 21:59:40,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {1997#(<= 1 __VERIFIER_assert_~cond)} [105] L7-->L8: 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[] {1902#false} is VALID [2022-04-07 21:59:40,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __VERIFIER_assertENTRY-->L7: 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] {1997#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:59:40,413 INFO L272 TraceCheckUtils]: 23: Hoare triple {1989#(= |main_#t~mem12| |main_#t~mem11|)} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {1993#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:59:40,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {2016#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {1989#(= |main_#t~mem12| |main_#t~mem11|)} is VALID [2022-04-07 21:59:40,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {2020#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {2016#(= (select (select |#memory_int| |main_~#str2~0.base|) (+ main_~j~0 |main_~#str2~0.offset|)) (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)))} is VALID [2022-04-07 21:59:40,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 0 main_~i~0))} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {2020#(= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|)))} is VALID [2022-04-07 21:59:40,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {2028#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 1 main_~i~0))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {2024#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 0 main_~i~0))} is VALID [2022-04-07 21:59:40,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {2032#(or (not (<= 0 main_~i~0)) (<= 1 main_~i~0) (= main_~MAX~0 (+ main_~j~0 1)))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {2028#(or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ (- 1) main_~MAX~0 |main_~#str2~0.offset|))) (<= 1 main_~i~0))} is VALID [2022-04-07 21:59:40,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {2036#(or (<= 2 main_~i~0) (not (<= 1 main_~i~0)) (= main_~MAX~0 (+ main_~j~0 1)))} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {2032#(or (not (<= 0 main_~i~0)) (<= 1 main_~i~0) (= main_~MAX~0 (+ main_~j~0 1)))} is VALID [2022-04-07 21:59:40,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {2040#(or (<= 2 main_~i~0) (= main_~MAX~0 (+ main_~j~0 2)) (not (<= 1 main_~i~0)))} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {2036#(or (<= 2 main_~i~0) (not (<= 1 main_~i~0)) (= main_~MAX~0 (+ main_~j~0 1)))} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {1901#true} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {2040#(or (<= 2 main_~i~0) (= main_~MAX~0 (+ main_~j~0 2)) (not (<= 1 main_~i~0)))} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {1901#true} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {1901#true} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {1901#true} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1901#true} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {1901#true} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {1901#true} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1901#true} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1901#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {1901#true} is VALID [2022-04-07 21:59:40,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {1901#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1901#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1901#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1901#true} {1901#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {1901#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {1901#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#true} is VALID [2022-04-07 21:59:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-07 21:59:40,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130728943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:59:40,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 21:59:40,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 26 [2022-04-07 21:59:40,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237035064] [2022-04-07 21:59:40,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 21:59:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 21:59:40,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:40,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:40,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:40,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 21:59:40,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:40,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 21:59:40,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-04-07 21:59:40,457 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:43,936 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2022-04-07 21:59:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-07 21:59:43,937 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 21:59:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 135 transitions. [2022-04-07 21:59:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 135 transitions. [2022-04-07 21:59:43,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 135 transitions. [2022-04-07 21:59:44,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:44,038 INFO L225 Difference]: With dead ends: 125 [2022-04-07 21:59:44,038 INFO L226 Difference]: Without dead ends: 111 [2022-04-07 21:59:44,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=935, Invalid=4615, Unknown=0, NotChecked=0, Total=5550 [2022-04-07 21:59:44,041 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 95 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:44,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 97 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 21:59:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-07 21:59:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2022-04-07 21:59:44,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:44,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 71 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:44,157 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 71 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:44,157 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 71 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:44,159 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-07 21:59:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-07 21:59:44,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:44,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:44,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 111 states. [2022-04-07 21:59:44,160 INFO L87 Difference]: Start difference. First operand has 71 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 111 states. [2022-04-07 21:59:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:44,162 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-07 21:59:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-07 21:59:44,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:44,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:44,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:44,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-04-07 21:59:44,164 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 27 [2022-04-07 21:59:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:44,164 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-04-07 21:59:44,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:59:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-04-07 21:59:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 21:59:44,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:44,165 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:44,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 21:59:44,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:44,375 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -468461934, now seen corresponding path program 1 times [2022-04-07 21:59:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:44,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404411051] [2022-04-07 21:59:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:44,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {2712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 21:59:44,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2698#true} {2698#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 21:59:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:44,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {2698#true} [103] __VERIFIER_assertENTRY-->L7: 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] {2698#true} is VALID [2022-04-07 21:59:44,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [106] L7-->L7-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [109] L7-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} [112] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {2698#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:44,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {2712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 21:59:44,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2698#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {2698#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {2698#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {2698#true} is VALID [2022-04-07 21:59:44,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {2698#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {2698#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {2703#(= main_~i~0 0)} is VALID [2022-04-07 21:59:44,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {2703#(= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {2703#(= main_~i~0 0)} is VALID [2022-04-07 21:59:44,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2703#(= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {2704#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:44,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {2704#(<= main_~i~0 1)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {2705#(<= main_~MAX~0 1)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2705#(<= main_~MAX~0 1)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2705#(<= main_~MAX~0 1)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {2705#(<= main_~MAX~0 1)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {2705#(<= main_~MAX~0 1)} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,457 INFO L272 TraceCheckUtils]: 17: Hoare triple {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2698#true} is VALID [2022-04-07 21:59:44,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {2698#true} [103] __VERIFIER_assertENTRY-->L7: 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] {2698#true} is VALID [2022-04-07 21:59:44,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {2698#true} [106] L7-->L7-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {2698#true} [109] L7-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,457 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2698#true} {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} [112] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} [102] L36-1-->L35-2: Formula: (= (+ v_main_~j~0_4 1) v_main_~j~0_5) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~post13=|v_main_#t~post13_1|, main_~j~0=v_main_~j~0_4, main_#t~mem11=|v_main_#t~mem11_3|} AuxVars[] AssignedVars[main_#t~mem12, main_~j~0, main_#t~mem11, main_#t~post13] {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {2706#(and (= main_~i~0 0) (<= main_~MAX~0 1))} [104] L35-2-->L35-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~i~0] {2711#(<= main_~MAX~0 main_~i~0)} is VALID [2022-04-07 21:59:44,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {2711#(<= main_~MAX~0 main_~i~0)} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {2699#false} is VALID [2022-04-07 21:59:44,458 INFO L272 TraceCheckUtils]: 25: Hoare triple {2699#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2699#false} is VALID [2022-04-07 21:59:44,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {2699#false} [103] __VERIFIER_assertENTRY-->L7: 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] {2699#false} is VALID [2022-04-07 21:59:44,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {2699#false} [105] L7-->L8: 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[] {2699#false} is VALID [2022-04-07 21:59:44,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {2699#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 21:59:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 21:59:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404411051] [2022-04-07 21:59:44,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404411051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590577132] [2022-04-07 21:59:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:44,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:44,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:44,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:59:44,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 21:59:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:44,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 21:59:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:44,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:59:44,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {2698#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 21:59:44,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2698#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {2698#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {2698#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {2698#true} is VALID [2022-04-07 21:59:44,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {2698#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {2698#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {2737#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:44,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {2737#(<= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {2737#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:44,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2737#(<= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {2704#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:44,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {2704#(<= main_~i~0 1)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {2705#(<= main_~MAX~0 1)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {2705#(<= main_~MAX~0 1)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {2705#(<= main_~MAX~0 1)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {2705#(<= main_~MAX~0 1)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {2705#(<= main_~MAX~0 1)} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,633 INFO L272 TraceCheckUtils]: 17: Hoare triple {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2698#true} is VALID [2022-04-07 21:59:44,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {2698#true} [103] __VERIFIER_assertENTRY-->L7: 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] {2698#true} is VALID [2022-04-07 21:59:44,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {2698#true} [106] L7-->L7-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {2698#true} [109] L7-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,633 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2698#true} {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} [112] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} [102] L36-1-->L35-2: Formula: (= (+ v_main_~j~0_4 1) v_main_~j~0_5) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~post13=|v_main_#t~post13_1|, main_~j~0=v_main_~j~0_4, main_#t~mem11=|v_main_#t~mem11_3|} AuxVars[] AssignedVars[main_#t~mem12, main_~j~0, main_#t~mem11, main_#t~post13] {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2022-04-07 21:59:44,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {2762#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} [104] L35-2-->L35-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~i~0] {2787#(and (<= main_~MAX~0 1) (<= 1 main_~i~0))} is VALID [2022-04-07 21:59:44,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {2787#(and (<= main_~MAX~0 1) (<= 1 main_~i~0))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {2699#false} is VALID [2022-04-07 21:59:44,635 INFO L272 TraceCheckUtils]: 25: Hoare triple {2699#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2699#false} is VALID [2022-04-07 21:59:44,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {2699#false} [103] __VERIFIER_assertENTRY-->L7: 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] {2699#false} is VALID [2022-04-07 21:59:44,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {2699#false} [105] L7-->L8: 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[] {2699#false} is VALID [2022-04-07 21:59:44,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {2699#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 21:59:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 21:59:44,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:59:44,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {2699#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 21:59:44,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {2699#false} [105] L7-->L8: 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[] {2699#false} is VALID [2022-04-07 21:59:44,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {2699#false} [103] __VERIFIER_assertENTRY-->L7: 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] {2699#false} is VALID [2022-04-07 21:59:44,728 INFO L272 TraceCheckUtils]: 25: Hoare triple {2699#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2699#false} is VALID [2022-04-07 21:59:44,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {2711#(<= main_~MAX~0 main_~i~0)} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {2699#false} is VALID [2022-04-07 21:59:44,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {2818#(<= main_~MAX~0 (+ main_~i~0 1))} [104] L35-2-->L35-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~i~0] {2711#(<= main_~MAX~0 main_~i~0)} is VALID [2022-04-07 21:59:44,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {2818#(<= main_~MAX~0 (+ main_~i~0 1))} [102] L36-1-->L35-2: Formula: (= (+ v_main_~j~0_4 1) v_main_~j~0_5) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~post13=|v_main_#t~post13_1|, main_~j~0=v_main_~j~0_4, main_#t~mem11=|v_main_#t~mem11_3|} AuxVars[] AssignedVars[main_#t~mem12, main_~j~0, main_#t~mem11, main_#t~post13] {2818#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-07 21:59:44,729 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2698#true} {2818#(<= main_~MAX~0 (+ main_~i~0 1))} [112] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2818#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-07 21:59:44,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {2698#true} [109] L7-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {2698#true} [106] L7-->L7-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {2698#true} [103] __VERIFIER_assertENTRY-->L7: 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] {2698#true} is VALID [2022-04-07 21:59:44,729 INFO L272 TraceCheckUtils]: 17: Hoare triple {2818#(<= main_~MAX~0 (+ main_~i~0 1))} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {2698#true} is VALID [2022-04-07 21:59:44,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {2818#(<= main_~MAX~0 (+ main_~i~0 1))} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {2818#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-07 21:59:44,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {2705#(<= main_~MAX~0 1)} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {2818#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2022-04-07 21:59:44,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {2705#(<= main_~MAX~0 1)} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {2705#(<= main_~MAX~0 1)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {2705#(<= main_~MAX~0 1)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {2705#(<= main_~MAX~0 1)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {2704#(<= main_~i~0 1)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {2705#(<= main_~MAX~0 1)} is VALID [2022-04-07 21:59:44,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {2737#(<= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {2704#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:44,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {2737#(<= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {2737#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:44,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {2698#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {2737#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:44,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {2698#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {2698#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {2698#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2698#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {2698#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 21:59:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 21:59:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590577132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:59:44,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 21:59:44,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 21:59:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116142582] [2022-04-07 21:59:44,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 21:59:44,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-07 21:59:44,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:44,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 21:59:44,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:44,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 21:59:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 21:59:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 21:59:44,758 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 21:59:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:45,128 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2022-04-07 21:59:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 21:59:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-07 21:59:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 21:59:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-07 21:59:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 21:59:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-07 21:59:45,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 65 transitions. [2022-04-07 21:59:45,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:45,184 INFO L225 Difference]: With dead ends: 111 [2022-04-07 21:59:45,184 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 21:59:45,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-04-07 21:59:45,185 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:45,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 42 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:59:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 21:59:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-04-07 21:59:45,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:45,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 67 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:45,277 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 67 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:45,277 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 67 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:45,278 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-04-07 21:59:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-04-07 21:59:45,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:45,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:45,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 75 states. [2022-04-07 21:59:45,279 INFO L87 Difference]: Start difference. First operand has 67 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 75 states. [2022-04-07 21:59:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:45,280 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-04-07 21:59:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-04-07 21:59:45,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:45,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:45,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:45,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-04-07 21:59:45,292 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 29 [2022-04-07 21:59:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:45,292 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-04-07 21:59:45,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 21:59:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-07 21:59:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 21:59:45,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:45,294 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:45,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 21:59:45,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:45,494 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash -812414670, now seen corresponding path program 5 times [2022-04-07 21:59:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:45,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245738629] [2022-04-07 21:59:45,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:45,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {3333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3321#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3321#true} {3321#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {3321#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:59:45,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3321#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3321#true} {3321#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {3321#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {3321#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {3321#true} is VALID [2022-04-07 21:59:45,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {3321#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {3321#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {3326#(= main_~i~0 0)} is VALID [2022-04-07 21:59:45,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3326#(= main_~i~0 0)} is VALID [2022-04-07 21:59:45,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {3326#(= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {3327#(<= main_~i~0 1)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {3327#(<= main_~i~0 1)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {3328#(<= main_~i~0 2)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {3328#(<= main_~i~0 2)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3329#(<= main_~i~0 3)} is VALID [2022-04-07 21:59:45,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {3329#(<= main_~i~0 3)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {3330#(<= main_~MAX~0 3)} is VALID [2022-04-07 21:59:45,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {3330#(<= main_~MAX~0 3)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~i~0 2)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {3328#(<= main_~i~0 2)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {3327#(<= main_~i~0 1)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {3327#(<= main_~i~0 1)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:45,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {3331#(<= main_~i~0 0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:45,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {3331#(<= main_~i~0 0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3332#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-07 21:59:45,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {3332#(<= (+ main_~i~0 1) 0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3322#false} is VALID [2022-04-07 21:59:45,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {3322#false} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3322#false} is VALID [2022-04-07 21:59:45,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {3322#false} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {3322#false} is VALID [2022-04-07 21:59:45,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {3322#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {3322#false} is VALID [2022-04-07 21:59:45,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {3322#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {3322#false} is VALID [2022-04-07 21:59:45,576 INFO L272 TraceCheckUtils]: 27: Hoare triple {3322#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {3322#false} is VALID [2022-04-07 21:59:45,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {3322#false} [103] __VERIFIER_assertENTRY-->L7: 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] {3322#false} is VALID [2022-04-07 21:59:45,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {3322#false} [105] L7-->L8: 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[] {3322#false} is VALID [2022-04-07 21:59:45,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {3322#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3322#false} is VALID [2022-04-07 21:59:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:45,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245738629] [2022-04-07 21:59:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245738629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123796333] [2022-04-07 21:59:45,576 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 21:59:45,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:45,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:45,577 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:59:45,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 21:59:45,692 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-04-07 21:59:45,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 21:59:45,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 21:59:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:45,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:59:45,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {3321#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {3321#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3321#true} is VALID [2022-04-07 21:59:45,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {3321#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3321#true} {3321#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {3321#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {3321#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {3321#true} is VALID [2022-04-07 21:59:45,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {3321#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:45,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {3321#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:45,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {3331#(<= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:45,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {3331#(<= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {3327#(<= main_~i~0 1)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {3327#(<= main_~i~0 1)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {3328#(<= main_~i~0 2)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {3328#(<= main_~i~0 2)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3329#(<= main_~i~0 3)} is VALID [2022-04-07 21:59:45,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {3329#(<= main_~i~0 3)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {3330#(<= main_~MAX~0 3)} is VALID [2022-04-07 21:59:45,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {3330#(<= main_~MAX~0 3)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~i~0 2)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:45,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {3328#(<= main_~i~0 2)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {3327#(<= main_~i~0 1)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:45,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {3327#(<= main_~i~0 1)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:45,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {3331#(<= main_~i~0 0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:45,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {3331#(<= main_~i~0 0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3332#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {3332#(<= (+ main_~i~0 1) 0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {3322#false} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {3322#false} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {3322#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {3322#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L272 TraceCheckUtils]: 27: Hoare triple {3322#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {3322#false} [103] __VERIFIER_assertENTRY-->L7: 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] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {3322#false} [105] L7-->L8: 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[] {3322#false} is VALID [2022-04-07 21:59:45,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {3322#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3322#false} is VALID [2022-04-07 21:59:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:45,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:59:46,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {3322#false} [107] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3322#false} is VALID [2022-04-07 21:59:46,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {3322#false} [105] L7-->L8: 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[] {3322#false} is VALID [2022-04-07 21:59:46,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {3322#false} [103] __VERIFIER_assertENTRY-->L7: 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] {3322#false} is VALID [2022-04-07 21:59:46,008 INFO L272 TraceCheckUtils]: 27: Hoare triple {3322#false} [100] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= |v_main_#t~mem12_4| |v_main_#t~mem11_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem11=|v_main_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, __VERIFIER_assert_#in~cond, main_#t~mem11] {3322#false} is VALID [2022-04-07 21:59:46,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {3322#false} [98] L35-3-->L36: Formula: (and (= (select (select |v_#memory_int_1| |v_main_~#str1~0.base_2|) (+ |v_main_~#str1~0.offset_2| v_main_~i~0_7)) |v_main_#t~mem11_1|) (= (select (select |v_#memory_int_1| |v_main_~#str2~0.base_2|) (+ |v_main_~#str2~0.offset_2| v_main_~j~0_3)) |v_main_#t~mem12_1|) (< v_main_~i~0_7 v_main_~MAX~0_7)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#str2~0.offset=|v_main_~#str2~0.offset_2|, main_~#str2~0.base=|v_main_~#str2~0.base_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_2|, main_~j~0=v_main_~j~0_3, main_#t~mem11=|v_main_#t~mem11_1|, #memory_int=|v_#memory_int_1|, main_~#str1~0.base=|v_main_~#str1~0.base_2|, main_~i~0=v_main_~i~0_7, main_~MAX~0=v_main_~MAX~0_7} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem11] {3322#false} is VALID [2022-04-07 21:59:46,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {3322#false} [94] L29-4-->L35-3: Formula: (and (= v_main_~j~0_1 (+ (- 1) v_main_~MAX~0_3)) (= v_main_~i~0_3 0)) InVars {main_~MAX~0=v_main_~MAX~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~MAX~0=v_main_~MAX~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {3322#false} is VALID [2022-04-07 21:59:46,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {3322#false} [92] L29-3-->L29-4: Formula: (not (<= 0 v_main_~i~0_15)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {3322#false} is VALID [2022-04-07 21:59:46,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {3322#false} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3322#false} is VALID [2022-04-07 21:59:46,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {3332#(<= (+ main_~i~0 1) 0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3322#false} is VALID [2022-04-07 21:59:46,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {3331#(<= main_~i~0 0)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3332#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-07 21:59:46,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {3331#(<= main_~i~0 0)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:46,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {3327#(<= main_~i~0 1)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:46,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {3327#(<= main_~i~0 1)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:46,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {3328#(<= main_~i~0 2)} [95] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_1 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post7] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:46,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~i~0 2)} [93] L29-3-->L29-2: Formula: (and (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) (<= 0 v_main_~i~0_16) (= (store |v_#memory_int_7| |v_main_~#str2~0.base_5| (store (select |v_#memory_int_7| |v_main_~#str2~0.base_5|) (+ |v_main_~#str2~0.offset_5| v_main_~j~0_8) (select (select |v_#memory_int_7| |v_main_~#str1~0.base_7|) |v_main_~#str1~0.offset_7|))) |v_#memory_int_6|)) InVars {main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_8, #memory_int=|v_#memory_int_7|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_5|, main_~#str2~0.base=|v_main_~#str2~0.base_5|, main_~#str1~0.offset=|v_main_~#str1~0.offset_7|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_6|, main_~#str1~0.base=|v_main_~#str1~0.base_7|, main_~i~0=v_main_~i~0_16, main_#t~mem8=|v_main_#t~mem8_1|, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_~j~0, #memory_int, main_#t~mem8, main_#t~post9] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:46,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {3330#(<= main_~MAX~0 3)} [89] L22-4-->L29-3: Formula: (and (= v_main_~j~0_6 0) (= v_main_~i~0_14 (+ (- 1) v_main_~MAX~0_10)) (= (store |v_#memory_int_5| |v_main_~#str1~0.base_6| (store (select |v_#memory_int_5| |v_main_~#str1~0.base_6|) (+ |v_main_~#str1~0.offset_6| (- 1) v_main_~MAX~0_10) 0)) |v_#memory_int_4|)) InVars {#memory_int=|v_#memory_int_5|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~MAX~0=v_main_~MAX~0_10} OutVars{main_~#str1~0.offset=|v_main_~#str1~0.offset_6|, main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~#str1~0.base=|v_main_~#str1~0.base_6|, main_~MAX~0=v_main_~MAX~0_10} AuxVars[] AssignedVars[main_~j~0, main_~i~0, #memory_int] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:46,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {3329#(<= main_~i~0 3)} [87] L22-3-->L22-4: Formula: (not (< v_main_~i~0_8 v_main_~MAX~0_8)) InVars {main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~MAX~0=v_main_~MAX~0_8} AuxVars[] AssignedVars[] {3330#(<= main_~MAX~0 3)} is VALID [2022-04-07 21:59:46,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {3328#(<= main_~i~0 2)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3329#(<= main_~i~0 3)} is VALID [2022-04-07 21:59:46,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {3328#(<= main_~i~0 2)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:46,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {3327#(<= main_~i~0 1)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3328#(<= main_~i~0 2)} is VALID [2022-04-07 21:59:46,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {3327#(<= main_~i~0 1)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:46,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {3331#(<= main_~i~0 0)} [90] L22-2-->L22-3: Formula: (= v_main_~i~0_12 (+ v_main_~i~0_13 1)) InVars {main_~i~0=v_main_~i~0_13} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {3327#(<= main_~i~0 1)} is VALID [2022-04-07 21:59:46,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {3331#(<= main_~i~0 0)} [88] L22-3-->L22-2: Formula: (and (<= |v_main_#t~nondet6_2| 127) (<= 0 (+ |v_main_#t~nondet6_2| 128)) (= (store |v_#memory_int_3| |v_main_~#str1~0.base_3| (store (select |v_#memory_int_3| |v_main_~#str1~0.base_3|) (+ |v_main_~#str1~0.offset_3| v_main_~i~0_9) |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< v_main_~i~0_9 v_main_~MAX~0_9)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, #memory_int=|v_#memory_int_3|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~MAX~0=v_main_~MAX~0_9} OutVars{#memory_int=|v_#memory_int_2|, main_~#str1~0.base=|v_main_~#str1~0.base_3|, main_~i~0=v_main_~i~0_9, main_~#str1~0.offset=|v_main_~#str1~0.offset_3|, main_~MAX~0=v_main_~MAX~0_9} AuxVars[] AssignedVars[main_#t~nondet6, #memory_int] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:46,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {3321#true} [85] L17-2-->L22-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#str1~0.base_1| 1))) (and (= (store .cse0 |v_main_~#str2~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#str2~0.base_1|) (= |v_main_~#str2~0.offset_1| 0) (= |v_main_~#str1~0.offset_1| 0) (= 0 v_main_~cont~0_1) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#str1~0.base_1| v_main_~MAX~0_5) |v_main_~#str2~0.base_1| v_main_~MAX~0_5)) (< |v_#StackHeapBarrier_1| |v_main_~#str1~0.base_1|) (= (select .cse0 |v_main_~#str2~0.base_1|) 0) (not (= |v_main_~#str2~0.base_1| 0)) (= v_main_~i~0_4 0) (not (= |v_main_~#str1~0.base_1| 0)) (= (select |v_#valid_3| |v_main_~#str1~0.base_1|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, main_~MAX~0=v_main_~MAX~0_5, #valid=|v_#valid_3|} OutVars{main_~#str2~0.offset=|v_main_~#str2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#str2~0.base=|v_main_~#str2~0.base_1|, main_~#str1~0.offset=|v_main_~#str1~0.offset_1|, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_4, main_~#str1~0.base=|v_main_~#str1~0.base_1|, main_~cont~0=v_main_~cont~0_1, #length=|v_#length_1|, main_~MAX~0=v_main_~MAX~0_5} AuxVars[] AssignedVars[main_~#str2~0.offset, main_~#str2~0.base, main_~#str1~0.offset, main_~j~0, #valid, main_~i~0, main_~#str1~0.base, main_~cont~0, #length] {3331#(<= main_~i~0 0)} is VALID [2022-04-07 21:59:46,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {3321#true} [84] L17-->L17-2: Formula: (< 0 v_main_~MAX~0_4) InVars {main_~MAX~0=v_main_~MAX~0_4} OutVars{main_~MAX~0=v_main_~MAX~0_4} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {3321#true} [81] mainENTRY-->L17: Formula: (= (let ((.cse0 (mod |v_main_#t~nondet4_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_main_~MAX~0_1) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~MAX~0=v_main_~MAX~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~MAX~0] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {3321#true} [78] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3321#true} {3321#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {3321#true} [82] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {3321#true} [79] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= 2 (select |v_#length_4| 1)) (= (select |v_#length_4| 3) 12) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_7| 2) 1) (= (select |v_#length_4| 2) 18) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_7| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {3321#true} [77] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3321#true} is VALID [2022-04-07 21:59:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:59:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123796333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:59:46,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 21:59:46,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 10 [2022-04-07 21:59:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017051613] [2022-04-07 21:59:46,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 21:59:46,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2022-04-07 21:59:46,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:46,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-07 21:59:46,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:46,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 21:59:46,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:46,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 21:59:46,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-07 21:59:46,044 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-07 21:59:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:46,655 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2022-04-07 21:59:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 21:59:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2022-04-07 21:59:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-07 21:59:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-07 21:59:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-07 21:59:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-07 21:59:46,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 98 transitions. [2022-04-07 21:59:46,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:59:46,729 INFO L225 Difference]: With dead ends: 128 [2022-04-07 21:59:46,729 INFO L226 Difference]: Without dead ends: 106 [2022-04-07 21:59:46,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2022-04-07 21:59:46,729 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:46,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 32 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 21:59:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-07 21:59:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2022-04-07 21:59:46,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:46,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 75 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:46,844 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 75 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:46,845 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 75 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:46,852 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-04-07 21:59:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-04-07 21:59:46,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:46,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:46,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 106 states. [2022-04-07 21:59:46,852 INFO L87 Difference]: Start difference. First operand has 75 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 106 states. [2022-04-07 21:59:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:46,855 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-04-07 21:59:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-04-07 21:59:46,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:46,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:46,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:46,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 21:59:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-04-07 21:59:46,857 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 31 [2022-04-07 21:59:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:46,857 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-04-07 21:59:46,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-07 21:59:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-07 21:59:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 21:59:46,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:46,857 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:46,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 21:59:47,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:47,074 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1779570578, now seen corresponding path program 2 times [2022-04-07 21:59:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:47,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328260900] [2022-04-07 21:59:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:59:47,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 21:59:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:59:47,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 21:59:47,124 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 21:59:47,125 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:59:47,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 21:59:47,127 INFO L719 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2022-04-07 21:59:47,129 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-07 21:59:47,156 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 21:59:47,157 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 21:59:47,157 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 21:59:47,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:59:47 BasicIcfg [2022-04-07 21:59:47,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:59:47,158 INFO L158 Benchmark]: Toolchain (without parser) took 20278.34ms. Allocated memory was 222.3MB in the beginning and 360.7MB in the end (delta: 138.4MB). Free memory was 166.4MB in the beginning and 166.5MB in the end (delta: -155.3kB). Peak memory consumption was 138.5MB. Max. memory is 8.0GB. [2022-04-07 21:59:47,158 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 222.3MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:59:47,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.77ms. Allocated memory was 222.3MB in the beginning and 299.9MB in the end (delta: 77.6MB). Free memory was 166.3MB in the beginning and 271.7MB in the end (delta: -105.5MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-04-07 21:59:47,159 INFO L158 Benchmark]: Boogie Preprocessor took 43.60ms. Allocated memory is still 299.9MB. Free memory was 271.7MB in the beginning and 270.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 21:59:47,159 INFO L158 Benchmark]: RCFGBuilder took 259.68ms. Allocated memory is still 299.9MB. Free memory was 270.0MB in the beginning and 257.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 21:59:47,159 INFO L158 Benchmark]: IcfgTransformer took 23.90ms. Allocated memory is still 299.9MB. Free memory was 257.4MB in the beginning and 255.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:59:47,159 INFO L158 Benchmark]: TraceAbstraction took 19670.71ms. Allocated memory was 299.9MB in the beginning and 360.7MB in the end (delta: 60.8MB). Free memory was 255.3MB in the beginning and 166.5MB in the end (delta: 88.8MB). Peak memory consumption was 151.2MB. Max. memory is 8.0GB. [2022-04-07 21:59:47,160 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 222.3MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.77ms. Allocated memory was 222.3MB in the beginning and 299.9MB in the end (delta: 77.6MB). Free memory was 166.3MB in the beginning and 271.7MB in the end (delta: -105.5MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.60ms. Allocated memory is still 299.9MB. Free memory was 271.7MB in the beginning and 270.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 259.68ms. Allocated memory is still 299.9MB. Free memory was 270.0MB in the beginning and 257.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 23.90ms. Allocated memory is still 299.9MB. Free memory was 257.4MB in the beginning and 255.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 19670.71ms. Allocated memory was 299.9MB in the beginning and 360.7MB in the end (delta: 60.8MB). Free memory was 255.3MB in the beginning and 166.5MB in the end (delta: 88.8MB). Peak memory consumption was 151.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int MAX = __VERIFIER_nondet_uint(); [L17] COND FALSE !(!(MAX > 0)) VAL [MAX=2] [L18] char str1[MAX], str2[MAX]; [L19] int cont, i, j; [L20] cont = 0 [L22] i=0 VAL [cont=0, i=0, MAX=2, str1={5:0}, str2={4:0}] [L22] COND TRUE i= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={5:0}, str2={4:0}] [L29] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={5:0}, str2={4:0}] [L29] COND TRUE i >= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={5:0}, str2={4:0}] [L29] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={5:0}, str2={4:0}] [L29] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={5:0}, str2={4:0}] [L34] j = MAX-1 [L35] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={5:0}, str2={4:0}] [L35] COND TRUE i