/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:57:02,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:57:02,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:57:02,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:57:02,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:57:02,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:57:02,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:57:02,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:57:02,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:57:02,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:57:02,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:57:02,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:57:02,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:57:02,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:57:02,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:57:02,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:57:02,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:57:02,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:57:02,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:57:02,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:57:02,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:57:02,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:57:02,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:57:02,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:57:02,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:57:02,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:57:02,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:57:02,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:57:02,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:57:02,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:57:02,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:57:02,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:57:02,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:57:02,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:57:02,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:57:02,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:57:02,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:57:02,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:57:02,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:57:02,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:57:02,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:57:02,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:57:02,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:57:02,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:57:02,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:57:02,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:57:02,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:57:02,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:57:02,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:57:02,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:57:02,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:57:02,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:57:02,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:57:02,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:57:02,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:57:02,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:57:02,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:57:02,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:57:02,622 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:57:02,622 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:57:02,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:57:02,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:57:02,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:57:02,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:57:02,837 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:57:02,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2022-04-27 15:57:02,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0edd9018/c6ecd647f0204e339c1ed28dcf10894b/FLAG696b36e84 [2022-04-27 15:57:03,252 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:57:03,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2022-04-27 15:57:03,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0edd9018/c6ecd647f0204e339c1ed28dcf10894b/FLAG696b36e84 [2022-04-27 15:57:03,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0edd9018/c6ecd647f0204e339c1ed28dcf10894b [2022-04-27 15:57:03,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:57:03,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:57:03,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:57:03,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:57:03,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:57:03,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3713a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03, skipping insertion in model container [2022-04-27 15:57:03,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:57:03,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:57:03,438 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/string-2.i[896,909] [2022-04-27 15:57:03,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:57:03,464 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:57:03,475 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/string-2.i[896,909] [2022-04-27 15:57:03,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:57:03,496 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:57:03,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03 WrapperNode [2022-04-27 15:57:03,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:57:03,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:57:03,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:57:03,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:57:03,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:57:03,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:57:03,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:57:03,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:57:03,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:57:03,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:03,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:57:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:57:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:57:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:57:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:57:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 15:57:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:57:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:57:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:57:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:57:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:57:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:57:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:57:03,658 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:57:03,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:57:03,942 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:57:03,954 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:57:03,954 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 15:57:03,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:03 BoogieIcfgContainer [2022-04-27 15:57:03,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:57:03,956 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:57:03,956 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:57:03,958 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:57:03,960 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:03" (1/1) ... [2022-04-27 15:57:03,962 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:57:04,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:57:04 BasicIcfg [2022-04-27 15:57:04,022 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:57:04,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:57:04,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:57:04,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:57:04,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:57:03" (1/4) ... [2022-04-27 15:57:04,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f6a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:57:04, skipping insertion in model container [2022-04-27 15:57:04,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:03" (2/4) ... [2022-04-27 15:57:04,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f6a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:57:04, skipping insertion in model container [2022-04-27 15:57:04,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:03" (3/4) ... [2022-04-27 15:57:04,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f6a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:57:04, skipping insertion in model container [2022-04-27 15:57:04,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:57:04" (4/4) ... [2022-04-27 15:57:04,029 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.iJordan [2022-04-27 15:57:04,043 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:57:04,043 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:57:04,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:57:04,099 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@695f45aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1dea758a [2022-04-27 15:57:04,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:57:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:57:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:57:04,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:04,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:04,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1544634334, now seen corresponding path program 1 times [2022-04-27 15:57:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:04,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646000085] [2022-04-27 15:57:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:04,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 15:57:04,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:57:04,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:57:04,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:04,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 15:57:04,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:57:04,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:57:04,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:57:04,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {38#true} is VALID [2022-04-27 15:57:04,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} [133] L35-3-->L35-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:57:04,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {39#false} is VALID [2022-04-27 15:57:04,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {39#false} is VALID [2022-04-27 15:57:04,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} [141] L39-3-->L39-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:57:04,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {39#false} is VALID [2022-04-27 15:57:04,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {39#false} is VALID [2022-04-27 15:57:04,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} [148] L44-3-->L44-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:57:04,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {39#false} is VALID [2022-04-27 15:57:04,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} [153] L48-3-->L48-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:57:04,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {39#false} is VALID [2022-04-27 15:57:04,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:57:04,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {39#false} is VALID [2022-04-27 15:57:04,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {39#false} is VALID [2022-04-27 15:57:04,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {39#false} is VALID [2022-04-27 15:57:04,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} [168] L19-->L20: Formula: (= 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[] {39#false} is VALID [2022-04-27 15:57:04,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:57:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:04,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646000085] [2022-04-27 15:57:04,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646000085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:57:04,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:57:04,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:57:04,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703841717] [2022-04-27 15:57:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:57:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 22 [2022-04-27 15:57:04,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:04,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:04,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:57:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:57:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:57:04,397 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:04,517 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 15:57:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:57:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 22 [2022-04-27 15:57:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 15:57:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 15:57:04,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-04-27 15:57:04,600 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-27 15:57:04,612 INFO L225 Difference]: With dead ends: 35 [2022-04-27 15:57:04,612 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 15:57:04,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:57:04,621 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:04,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:57:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 15:57:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 15:57:04,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:04,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,646 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,646 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:04,656 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 15:57:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 15:57:04,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:04,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 15:57:04,658 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 15:57:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:04,661 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 15:57:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 15:57:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:04,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:04,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:04,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-04-27 15:57:04,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2022-04-27 15:57:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:04,667 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-04-27 15:57:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 15:57:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:57:04,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:04,669 INFO L195 NwaCegarLoop]: trace histogram [1, 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-27 15:57:04,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:57:04,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:04,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1694186334, now seen corresponding path program 1 times [2022-04-27 15:57:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:04,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422027559] [2022-04-27 15:57:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:04,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:04,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {165#true} is VALID [2022-04-27 15:57:04,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:57:04,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:57:04,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:04,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {165#true} is VALID [2022-04-27 15:57:04,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:57:04,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:57:04,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:57:04,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {170#(= main_~i~0 0)} is VALID [2022-04-27 15:57:04,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {170#(= main_~i~0 0)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:57:04,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {166#false} is VALID [2022-04-27 15:57:04,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {166#false} is VALID [2022-04-27 15:57:04,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:57:04,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {166#false} is VALID [2022-04-27 15:57:04,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {166#false} is VALID [2022-04-27 15:57:04,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {166#false} is VALID [2022-04-27 15:57:04,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {166#false} is VALID [2022-04-27 15:57:04,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {166#false} is VALID [2022-04-27 15:57:04,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {166#false} is VALID [2022-04-27 15:57:04,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {166#false} is VALID [2022-04-27 15:57:04,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {166#false} is VALID [2022-04-27 15:57:04,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:57:04,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {166#false} is VALID [2022-04-27 15:57:04,798 INFO L272 TraceCheckUtils]: 20: Hoare triple {166#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {166#false} is VALID [2022-04-27 15:57:04,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {166#false} is VALID [2022-04-27 15:57:04,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#false} [168] L19-->L20: Formula: (= 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[] {166#false} is VALID [2022-04-27 15:57:04,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:57:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422027559] [2022-04-27 15:57:04,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422027559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:57:04,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:57:04,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:57:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345906997] [2022-04-27 15:57:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:57:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-04-27 15:57:04,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:04,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:57:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:57:04,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:57:04,832 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:04,952 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 15:57:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:57:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-04-27 15:57:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 15:57:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 15:57:04,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-27 15:57:05,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:05,005 INFO L225 Difference]: With dead ends: 36 [2022-04-27 15:57:05,006 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 15:57:05,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:57:05,009 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:05,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:57:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 15:57:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-27 15:57:05,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:05,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,020 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,020 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:05,024 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 15:57:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 15:57:05,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:05,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:05,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 15:57:05,025 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 15:57:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:05,030 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 15:57:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 15:57:05,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:05,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:05,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:05,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-27 15:57:05,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2022-04-27 15:57:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:05,035 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-27 15:57:05,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 15:57:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:57:05,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:05,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-27 15:57:05,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:57:05,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash 132080930, now seen corresponding path program 1 times [2022-04-27 15:57:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:05,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513919188] [2022-04-27 15:57:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:05,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:05,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:57:05,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:05,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:57:05,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {319#(= main_~i~0 0)} is VALID [2022-04-27 15:57:05,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(= main_~i~0 0)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {319#(= main_~i~0 0)} is VALID [2022-04-27 15:57:05,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#(= main_~i~0 0)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {320#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:05,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= main_~i~0 1)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {315#false} is VALID [2022-04-27 15:57:05,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {315#false} is VALID [2022-04-27 15:57:05,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {315#false} is VALID [2022-04-27 15:57:05,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {315#false} is VALID [2022-04-27 15:57:05,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:57:05,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:57:05,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {315#false} is VALID [2022-04-27 15:57:05,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:57:05,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:57:05,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {315#false} is VALID [2022-04-27 15:57:05,138 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {315#false} is VALID [2022-04-27 15:57:05,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {315#false} is VALID [2022-04-27 15:57:05,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#false} [168] L19-->L20: Formula: (= 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[] {315#false} is VALID [2022-04-27 15:57:05,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:57:05,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513919188] [2022-04-27 15:57:05,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513919188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:57:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917928564] [2022-04-27 15:57:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:05,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:57:05,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 15:57:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:05,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 15:57:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:05,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:57:05,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:57:05,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {340#(<= main_~i~0 0)} is VALID [2022-04-27 15:57:05,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {340#(<= main_~i~0 0)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {340#(<= main_~i~0 0)} is VALID [2022-04-27 15:57:05,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= main_~i~0 0)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {320#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:05,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= main_~i~0 1)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {315#false} is VALID [2022-04-27 15:57:05,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {315#false} is VALID [2022-04-27 15:57:05,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {315#false} is VALID [2022-04-27 15:57:05,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {315#false} is VALID [2022-04-27 15:57:05,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:57:05,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:57:05,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {315#false} is VALID [2022-04-27 15:57:05,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:57:05,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:57:05,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {315#false} is VALID [2022-04-27 15:57:05,358 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {315#false} is VALID [2022-04-27 15:57:05,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {315#false} is VALID [2022-04-27 15:57:05,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#false} [168] L19-->L20: Formula: (= 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[] {315#false} is VALID [2022-04-27 15:57:05,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:57:05,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:57:05,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#false} [168] L19-->L20: Formula: (= 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[] {315#false} is VALID [2022-04-27 15:57:05,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {315#false} is VALID [2022-04-27 15:57:05,488 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {315#false} is VALID [2022-04-27 15:57:05,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {315#false} is VALID [2022-04-27 15:57:05,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:57:05,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:57:05,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {315#false} is VALID [2022-04-27 15:57:05,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:57:05,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:57:05,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {315#false} is VALID [2022-04-27 15:57:05,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {315#false} is VALID [2022-04-27 15:57:05,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {315#false} is VALID [2022-04-27 15:57:05,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {315#false} is VALID [2022-04-27 15:57:05,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {315#false} is VALID [2022-04-27 15:57:05,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(< main_~i~0 5)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:57:05,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {468#(< main_~i~0 4)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {464#(< main_~i~0 5)} is VALID [2022-04-27 15:57:05,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {468#(< main_~i~0 4)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {468#(< main_~i~0 4)} is VALID [2022-04-27 15:57:05,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {468#(< main_~i~0 4)} is VALID [2022-04-27 15:57:05,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:57:05,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:57:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:57:05,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917928564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:57:05,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:57:05,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 15:57:05,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854822584] [2022-04-27 15:57:05,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:57:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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 28 [2022-04-27 15:57:05,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:05,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:05,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 15:57:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:05,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 15:57:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 15:57:05,536 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:05,851 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 15:57:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:57:05,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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 28 [2022-04-27 15:57:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 15:57:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 15:57:05,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-27 15:57:05,937 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-27 15:57:05,938 INFO L225 Difference]: With dead ends: 58 [2022-04-27 15:57:05,939 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 15:57:05,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:57:05,940 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:05,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 42 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:57:05,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 15:57:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-27 15:57:05,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:05,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,945 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,945 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:05,948 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 15:57:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-27 15:57:05,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:05,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:05,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 15:57:05,949 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 15:57:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:05,952 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 15:57:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-27 15:57:05,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:05,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:05,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:05,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 15:57:05,954 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2022-04-27 15:57:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:05,955 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 15:57:05,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 15:57:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 15:57:05,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:05,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 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-27 15:57:06,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 15:57:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:06,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1964785826, now seen corresponding path program 2 times [2022-04-27 15:57:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507225803] [2022-04-27 15:57:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:06,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:06,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:57:06,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:06,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:57:06,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {721#(= main_~i~0 0)} is VALID [2022-04-27 15:57:06,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {721#(= main_~i~0 0)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {721#(= main_~i~0 0)} is VALID [2022-04-27 15:57:06,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {721#(= main_~i~0 0)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:06,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(<= main_~i~0 1)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:06,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#(<= main_~i~0 1)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:57:06,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(<= main_~i~0 2)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:57:06,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#(<= main_~i~0 2)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:57:06,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(<= main_~i~0 3)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:57:06,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(<= main_~i~0 3)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {725#(<= main_~i~0 4)} is VALID [2022-04-27 15:57:06,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#(<= main_~i~0 4)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {717#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {717#false} is VALID [2022-04-27 15:57:06,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {717#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {717#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {717#false} is VALID [2022-04-27 15:57:06,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {717#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {717#false} is VALID [2022-04-27 15:57:06,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {717#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:57:06,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {717#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:57:06,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {717#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {717#false} is VALID [2022-04-27 15:57:06,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {717#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:57:06,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {717#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:57:06,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {717#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {717#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {717#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {717#false} is VALID [2022-04-27 15:57:06,375 INFO L272 TraceCheckUtils]: 36: Hoare triple {717#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {717#false} is VALID [2022-04-27 15:57:06,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {717#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {717#false} is VALID [2022-04-27 15:57:06,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#false} [168] L19-->L20: Formula: (= 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[] {717#false} is VALID [2022-04-27 15:57:06,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {717#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:57:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:06,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507225803] [2022-04-27 15:57:06,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507225803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:57:06,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52620150] [2022-04-27 15:57:06,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 15:57:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:06,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:06,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:57:06,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 15:57:06,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 15:57:06,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 15:57:06,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 15:57:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:06,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:57:06,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:57:06,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {745#(<= main_~i~0 0)} is VALID [2022-04-27 15:57:06,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#(<= main_~i~0 0)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {745#(<= main_~i~0 0)} is VALID [2022-04-27 15:57:06,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {745#(<= main_~i~0 0)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:06,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(<= main_~i~0 1)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:06,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#(<= main_~i~0 1)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:57:06,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(<= main_~i~0 2)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:57:06,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#(<= main_~i~0 2)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:57:06,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(<= main_~i~0 3)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:57:06,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(<= main_~i~0 3)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {725#(<= main_~i~0 4)} is VALID [2022-04-27 15:57:06,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#(<= main_~i~0 4)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {717#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {717#false} is VALID [2022-04-27 15:57:06,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {717#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {717#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {717#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {717#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {717#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {717#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {717#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:57:06,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {717#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:57:06,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {717#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {717#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {717#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {717#false} is VALID [2022-04-27 15:57:06,627 INFO L272 TraceCheckUtils]: 36: Hoare triple {717#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {717#false} is VALID [2022-04-27 15:57:06,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {717#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {717#false} is VALID [2022-04-27 15:57:06,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#false} [168] L19-->L20: Formula: (= 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[] {717#false} is VALID [2022-04-27 15:57:06,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {717#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:57:06,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:57:06,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {717#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#false} [168] L19-->L20: Formula: (= 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[] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {717#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L272 TraceCheckUtils]: 36: Hoare triple {717#false} [165] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {717#false} [162] L55-2-->L71: Formula: true InVars {} OutVars{main_~found~0=v_main_~found~0_2} AuxVars[] AssignedVars[main_~found~0] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {717#false} [160] L57-2-->L55-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {717#false} [156] L48-4-->L57-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {717#false} [157] L48-1-->L48-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:57:06,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {717#false} [154] L48-3-->L48-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {717#false} [150] L44-4-->L48-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {717#false} [151] L44-1-->L44-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {717#false} [149] L44-3-->L44-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {717#false} [147] L41-->L44-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} [144] L39-4-->L41: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {717#false} [142] L39-3-->L39-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#false} [145] L39-2-->L39-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#false} [143] L39-3-->L39-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:57:06,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {717#false} [139] L37-->L39-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {717#false} is VALID [2022-04-27 15:57:06,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {717#false} [136] L35-4-->L37: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {717#false} is VALID [2022-04-27 15:57:06,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#(<= main_~i~0 4)} [134] L35-3-->L35-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:57:06,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(<= main_~i~0 3)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {725#(<= main_~i~0 4)} is VALID [2022-04-27 15:57:06,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(<= main_~i~0 3)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:57:06,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#(<= main_~i~0 2)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:57:06,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(<= main_~i~0 2)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:57:06,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#(<= main_~i~0 1)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:57:06,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(<= main_~i~0 1)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:06,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {745#(<= main_~i~0 0)} [137] L35-2-->L35-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:57:06,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#(<= main_~i~0 0)} [135] L35-3-->L35-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {745#(<= main_~i~0 0)} is VALID [2022-04-27 15:57:06,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} [131] mainENTRY-->L35-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {745#(<= main_~i~0 0)} is VALID [2022-04-27 15:57:06,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:57:06,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:57:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:57:06,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52620150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:57:06,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:57:06,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-27 15:57:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354343828] [2022-04-27 15:57:06,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:57:06,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 40 [2022-04-27 15:57:06,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:06,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:06,802 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-27 15:57:06,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:57:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:57:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:57:06,803 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:07,118 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-27 15:57:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:57:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 40 [2022-04-27 15:57:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-27 15:57:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-27 15:57:07,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-27 15:57:07,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:07,204 INFO L225 Difference]: With dead ends: 66 [2022-04-27 15:57:07,204 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 15:57:07,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 15:57:07,205 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:07,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 42 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:57:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 15:57:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-04-27 15:57:07,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:07,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,209 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,210 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:07,212 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-27 15:57:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-27 15:57:07,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:07,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:07,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-27 15:57:07,213 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-27 15:57:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:07,217 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-27 15:57:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-27 15:57:07,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:07,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:07,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:07,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 15:57:07,224 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2022-04-27 15:57:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:07,225 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 15:57:07,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 15:57:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 15:57:07,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:07,228 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 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-27 15:57:07,256 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-27 15:57:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 15:57:07,444 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -644915934, now seen corresponding path program 3 times [2022-04-27 15:57:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:07,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117888936] [2022-04-27 15:57:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:57:07,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:57:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:57:07,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:57:07,594 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:57:07,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:57:07,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:57:07,599 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 15:57:07,601 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:57:07,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:57:07 BasicIcfg [2022-04-27 15:57:07,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:57:07,632 INFO L158 Benchmark]: Toolchain (without parser) took 4357.98ms. Allocated memory was 191.9MB in the beginning and 239.1MB in the end (delta: 47.2MB). Free memory was 135.8MB in the beginning and 107.8MB in the end (delta: 27.9MB). Peak memory consumption was 75.4MB. Max. memory is 8.0GB. [2022-04-27 15:57:07,632 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:57:07,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.12ms. Allocated memory was 191.9MB in the beginning and 239.1MB in the end (delta: 47.2MB). Free memory was 135.5MB in the beginning and 208.5MB in the end (delta: -73.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-27 15:57:07,633 INFO L158 Benchmark]: Boogie Preprocessor took 33.00ms. Allocated memory is still 239.1MB. Free memory was 208.5MB in the beginning and 206.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:57:07,633 INFO L158 Benchmark]: RCFGBuilder took 424.62ms. Allocated memory is still 239.1MB. Free memory was 206.6MB in the beginning and 192.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 15:57:07,633 INFO L158 Benchmark]: IcfgTransformer took 65.59ms. Allocated memory is still 239.1MB. Free memory was 192.0MB in the beginning and 189.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:57:07,634 INFO L158 Benchmark]: TraceAbstraction took 3607.36ms. Allocated memory is still 239.1MB. Free memory was 189.6MB in the beginning and 107.8MB in the end (delta: 81.8MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. [2022-04-27 15:57:07,635 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.09ms. Allocated memory is still 191.9MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.12ms. Allocated memory was 191.9MB in the beginning and 239.1MB in the end (delta: 47.2MB). Free memory was 135.5MB in the beginning and 208.5MB in the end (delta: -73.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.00ms. Allocated memory is still 239.1MB. Free memory was 208.5MB in the beginning and 206.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 424.62ms. Allocated memory is still 239.1MB. Free memory was 206.6MB in the beginning and 192.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 65.59ms. Allocated memory is still 239.1MB. Free memory was 192.0MB in the beginning and 189.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3607.36ms. Allocated memory is still 239.1MB. Free memory was 189.6MB in the beginning and 107.8MB in the end (delta: 81.8MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={6:0}, string_A[5 -1]=0, string_B={7:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={6:0}, string_B={7:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_A[nc_A]=0, string_B={7:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L55] COND FALSE !((inc_B-1)<