java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/string_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:23:32,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:23:32,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:23:32,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:23:32,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:23:32,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:23:32,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:23:32,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:23:32,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:23:32,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:23:32,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:23:32,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:23:32,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:23:32,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:23:32,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:23:32,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:23:32,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:23:32,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:23:32,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:23:32,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:23:32,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:23:32,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:23:32,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:23:32,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:23:32,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:23:32,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:23:32,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:23:32,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:23:32,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:23:32,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:23:32,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:23:32,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:23:32,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:23:32,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:23:32,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:23:32,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:23:32,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:23:32,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:23:32,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:23:32,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:23:32,880 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:23:32,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:23:32,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:23:32,883 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:23:32,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:23:32,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:23:32,884 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:23:32,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:23:32,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:23:32,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:23:32,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:23:32,885 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:23:32,885 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:23:32,885 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:23:32,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:23:32,887 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:23:32,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:23:32,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:23:32,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:23:32,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:23:32,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:23:32,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:32,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:23:32,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:23:32,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:23:32,889 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:23:32,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:23:32,890 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:23:32,890 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:23:32,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:23:32,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:23:32,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:23:32,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:23:32,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:23:32,963 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:23:32,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string_false-unreach-call_true-termination.i [2018-11-23 11:23:33,021 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62465800/d56db6c116f4483bb8f23e909f65c0ed/FLAGd747dffd4 [2018-11-23 11:23:33,444 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:23:33,444 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_false-unreach-call_true-termination.i [2018-11-23 11:23:33,452 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62465800/d56db6c116f4483bb8f23e909f65c0ed/FLAGd747dffd4 [2018-11-23 11:23:33,824 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62465800/d56db6c116f4483bb8f23e909f65c0ed [2018-11-23 11:23:33,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:23:33,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:23:33,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:33,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:23:33,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:23:33,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:33" (1/1) ... [2018-11-23 11:23:33,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36111f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:33, skipping insertion in model container [2018-11-23 11:23:33,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:33" (1/1) ... [2018-11-23 11:23:33,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:23:33,884 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:23:34,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:34,160 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:23:34,194 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:34,222 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:23:34,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34 WrapperNode [2018-11-23 11:23:34,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:34,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:34,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:23:34,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:23:34,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:34,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:23:34,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:23:34,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:23:34,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... [2018-11-23 11:23:34,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:23:34,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:23:34,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:23:34,300 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:23:34,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:23:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:23:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:23:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:23:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:23:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:23:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:23:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:23:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:23:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:23:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:23:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:23:35,362 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:23:35,363 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:23:35,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:35 BoogieIcfgContainer [2018-11-23 11:23:35,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:23:35,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:23:35,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:23:35,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:23:35,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:23:33" (1/3) ... [2018-11-23 11:23:35,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e10190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:35, skipping insertion in model container [2018-11-23 11:23:35,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:34" (2/3) ... [2018-11-23 11:23:35,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e10190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:35, skipping insertion in model container [2018-11-23 11:23:35,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:35" (3/3) ... [2018-11-23 11:23:35,374 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-23 11:23:35,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:23:35,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:23:35,412 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:23:35,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:23:35,445 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:23:35,446 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:23:35,446 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:23:35,446 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:23:35,446 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:23:35,447 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:23:35,447 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:23:35,447 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:23:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 11:23:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:23:35,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:35,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:35,474 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:35,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 11:23:35,483 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:35,484 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:35,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:35,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 11:23:35,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {38#true} is VALID [2018-11-23 11:23:35,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 11:23:35,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2018-11-23 11:23:35,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2018-11-23 11:23:35,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {38#true} is VALID [2018-11-23 11:23:35,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 11:23:35,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {39#false} is VALID [2018-11-23 11:23:35,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {39#false} is VALID [2018-11-23 11:23:35,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:23:35,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {39#false} is VALID [2018-11-23 11:23:35,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {39#false} is VALID [2018-11-23 11:23:35,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:23:35,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0bv32; {39#false} is VALID [2018-11-23 11:23:35,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:23:35,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {39#false} is VALID [2018-11-23 11:23:35,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:23:35,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {39#false} is VALID [2018-11-23 11:23:35,689 INFO L256 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {39#false} is VALID [2018-11-23 11:23:35,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 11:23:35,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0bv32 == ~cond; {39#false} is VALID [2018-11-23 11:23:35,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 11:23:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:35,695 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:35,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:35,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:23:35,709 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 11:23:35,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:35,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:23:35,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:35,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:23:35,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:23:35,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:23:35,811 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 11:23:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:35,977 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 11:23:35,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:23:35,977 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 11:23:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 11:23:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 11:23:36,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2018-11-23 11:23:36,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:36,338 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:23:36,338 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:23:36,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:23:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:23:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:23:36,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:36,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:23:36,520 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:23:36,520 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:23:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:36,532 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:23:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:23:36,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:36,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:36,534 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:23:36,535 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:23:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:36,541 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:23:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:23:36,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:36,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:36,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:36,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:23:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 11:23:36,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 11:23:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:36,550 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 11:23:36,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:23:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:23:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:23:36,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:36,553 INFO L402 BasicCegarLoop]: 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] [2018-11-23 11:23:36,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:36,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 11:23:36,556 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:36,556 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:36,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:36,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:23:36,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {279#true} is VALID [2018-11-23 11:23:36,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:23:36,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #107#return; {279#true} is VALID [2018-11-23 11:23:36,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret15 := main(); {279#true} is VALID [2018-11-23 11:23:36,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {299#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:23:36,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {280#false} is VALID [2018-11-23 11:23:36,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {280#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {280#false} is VALID [2018-11-23 11:23:36,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {280#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {280#false} is VALID [2018-11-23 11:23:36,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {280#false} assume !~bvslt32(~i~0, 5bv32); {280#false} is VALID [2018-11-23 11:23:36,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {280#false} is VALID [2018-11-23 11:23:36,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {280#false} is VALID [2018-11-23 11:23:36,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {280#false} is VALID [2018-11-23 11:23:36,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {280#false} is VALID [2018-11-23 11:23:36,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} ~nc_B~0 := 0bv32; {280#false} is VALID [2018-11-23 11:23:36,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {280#false} is VALID [2018-11-23 11:23:36,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {280#false} is VALID [2018-11-23 11:23:36,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {280#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {280#false} is VALID [2018-11-23 11:23:36,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {280#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {280#false} is VALID [2018-11-23 11:23:36,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {280#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {280#false} is VALID [2018-11-23 11:23:36,952 INFO L256 TraceCheckUtils]: 20: Hoare triple {280#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {280#false} is VALID [2018-11-23 11:23:36,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:23:36,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {280#false} assume 0bv32 == ~cond; {280#false} is VALID [2018-11-23 11:23:36,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:23:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:36,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:36,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:23:36,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:23:36,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:36,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:23:37,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:37,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:23:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:23:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:23:37,049 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 11:23:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:37,765 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 11:23:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:23:37,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:23:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:23:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 11:23:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:23:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 11:23:37,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 11:23:38,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:38,079 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:23:38,079 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:23:38,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:23:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:23:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 11:23:38,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:38,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-23 11:23:38,116 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-23 11:23:38,116 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-23 11:23:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:38,120 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:23:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:23:38,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:38,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:38,121 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-23 11:23:38,121 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-23 11:23:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:38,125 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:23:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:23:38,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:38,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:38,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:38,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:23:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 11:23:38,129 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 11:23:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:38,129 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 11:23:38,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:23:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 11:23:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:23:38,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:38,131 INFO L402 BasicCegarLoop]: 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] [2018-11-23 11:23:38,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:38,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:38,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 11:23:38,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:38,132 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:38,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:38,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2018-11-23 11:23:38,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {545#true} is VALID [2018-11-23 11:23:38,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2018-11-23 11:23:38,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #107#return; {545#true} is VALID [2018-11-23 11:23:38,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret15 := main(); {545#true} is VALID [2018-11-23 11:23:38,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {565#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:23:38,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {565#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {565#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:23:38,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {565#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {572#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:38,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:23:38,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {546#false} is VALID [2018-11-23 11:23:38,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {546#false} is VALID [2018-11-23 11:23:38,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {546#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {546#false} is VALID [2018-11-23 11:23:38,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {546#false} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:23:38,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {546#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {546#false} is VALID [2018-11-23 11:23:38,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {546#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {546#false} is VALID [2018-11-23 11:23:38,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {546#false} ~nc_B~0 := 0bv32; {546#false} is VALID [2018-11-23 11:23:38,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {546#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {546#false} is VALID [2018-11-23 11:23:38,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {546#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {546#false} is VALID [2018-11-23 11:23:38,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {546#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {546#false} is VALID [2018-11-23 11:23:38,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {546#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {546#false} is VALID [2018-11-23 11:23:38,350 INFO L256 TraceCheckUtils]: 24: Hoare triple {546#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {546#false} is VALID [2018-11-23 11:23:38,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {546#false} ~cond := #in~cond; {546#false} is VALID [2018-11-23 11:23:38,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {546#false} assume 0bv32 == ~cond; {546#false} is VALID [2018-11-23 11:23:38,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {546#false} assume !false; {546#false} is VALID [2018-11-23 11:23:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:23:38,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:38,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {546#false} assume !false; {546#false} is VALID [2018-11-23 11:23:38,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {546#false} assume 0bv32 == ~cond; {546#false} is VALID [2018-11-23 11:23:38,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {546#false} ~cond := #in~cond; {546#false} is VALID [2018-11-23 11:23:38,480 INFO L256 TraceCheckUtils]: 24: Hoare triple {546#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {546#false} is VALID [2018-11-23 11:23:38,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {546#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {546#false} is VALID [2018-11-23 11:23:38,481 INFO L273 TraceCheckUtils]: 22: Hoare triple {546#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {546#false} is VALID [2018-11-23 11:23:38,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {546#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {546#false} is VALID [2018-11-23 11:23:38,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {546#false} is VALID [2018-11-23 11:23:38,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {546#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {546#false} ~nc_B~0 := 0bv32; {546#false} is VALID [2018-11-23 11:23:38,482 INFO L273 TraceCheckUtils]: 17: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {546#false} is VALID [2018-11-23 11:23:38,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {546#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {546#false} is VALID [2018-11-23 11:23:38,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {546#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {546#false} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:23:38,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {546#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {546#false} is VALID [2018-11-23 11:23:38,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {546#false} is VALID [2018-11-23 11:23:38,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {546#false} is VALID [2018-11-23 11:23:38,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:23:38,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {690#(bvslt main_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:23:38,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {690#(bvslt main_~i~0 (_ bv5 32))} is VALID [2018-11-23 11:23:38,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:38,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:38,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret15 := main(); {545#true} is VALID [2018-11-23 11:23:38,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #107#return; {545#true} is VALID [2018-11-23 11:23:38,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2018-11-23 11:23:38,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {545#true} is VALID [2018-11-23 11:23:38,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2018-11-23 11:23:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:23:38,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:38,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:23:38,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:23:38,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:38,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:23:38,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:38,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:23:38,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:23:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:23:38,588 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2018-11-23 11:23:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:39,277 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:23:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:23:39,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:23:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:23:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 11:23:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:23:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 11:23:39,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2018-11-23 11:23:39,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:39,544 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:23:39,544 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:23:39,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:23:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:23:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-11-23 11:23:39,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:39,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 42 states. [2018-11-23 11:23:39,578 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 42 states. [2018-11-23 11:23:39,579 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 42 states. [2018-11-23 11:23:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:39,584 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-23 11:23:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-23 11:23:39,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:39,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:39,585 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 58 states. [2018-11-23 11:23:39,585 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 58 states. [2018-11-23 11:23:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:39,589 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-23 11:23:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-23 11:23:39,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:39,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:39,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:39,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:23:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 11:23:39,593 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2018-11-23 11:23:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:39,594 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 11:23:39,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:23:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:23:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:23:39,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:39,595 INFO L402 BasicCegarLoop]: 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] [2018-11-23 11:23:39,596 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:39,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 2 times [2018-11-23 11:23:39,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:39,597 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:39,617 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:39,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:23:39,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:39,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:39,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2018-11-23 11:23:39,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1010#true} is VALID [2018-11-23 11:23:39,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2018-11-23 11:23:39,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #107#return; {1010#true} is VALID [2018-11-23 11:23:39,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret15 := main(); {1010#true} is VALID [2018-11-23 11:23:39,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {1010#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {1010#true} is VALID [2018-11-23 11:23:39,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:23:39,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:23:39,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:23:39,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:23:39,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:23:39,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:23:39,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:23:39,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:23:39,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {1010#true} assume !~bvslt32(~i~0, 5bv32); {1010#true} is VALID [2018-11-23 11:23:39,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {1010#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {1010#true} is VALID [2018-11-23 11:23:39,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {1010#true} is VALID [2018-11-23 11:23:39,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:23:39,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:23:39,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:23:39,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:23:39,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:23:39,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:23:39,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:23:39,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:23:39,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {1010#true} assume !~bvslt32(~i~0, 5bv32); {1010#true} is VALID [2018-11-23 11:23:39,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {1010#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {1010#true} is VALID [2018-11-23 11:23:40,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {1010#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {1096#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:40,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {1096#(= main_~nc_A~0 (_ bv0 32))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {1096#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:40,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {1096#(= main_~nc_A~0 (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {1096#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:40,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {1096#(= main_~nc_A~0 (_ bv0 32))} ~nc_B~0 := 0bv32; {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:40,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:40,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:40,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:40,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0) (= main_~nc_B~0 (_ bv0 32)))} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:40,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0) (= main_~nc_B~0 (_ bv0 32)))} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {1123#(= (_ bv1 32) main_~found~0)} is VALID [2018-11-23 11:23:40,027 INFO L256 TraceCheckUtils]: 36: Hoare triple {1123#(= (_ bv1 32) main_~found~0)} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {1127#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:40,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {1127#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1131#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:40,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {1131#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1011#false} is VALID [2018-11-23 11:23:40,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2018-11-23 11:23:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:23:40,033 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:40,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:40,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:23:40,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:23:40,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:40,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:23:40,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:40,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:23:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:23:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:23:40,098 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 11:23:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:40,804 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 11:23:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:23:40,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:23:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:23:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 11:23:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:23:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 11:23:40,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2018-11-23 11:23:40,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:40,959 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:23:40,960 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:23:40,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:23:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:23:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-23 11:23:40,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:40,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-23 11:23:40,995 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-23 11:23:40,996 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-23 11:23:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:41,000 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 11:23:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 11:23:41,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:41,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:41,001 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-23 11:23:41,001 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-23 11:23:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:41,004 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 11:23:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 11:23:41,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:41,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:41,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:41,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:23:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 11:23:41,008 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2018-11-23 11:23:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:41,009 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 11:23:41,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:23:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:23:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:23:41,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:41,011 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:41,011 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:41,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1489958921, now seen corresponding path program 1 times [2018-11-23 11:23:41,012 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:41,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:23:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:41,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:41,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 11:23:41,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 11:23:41,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 11:23:41,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #107#return; {1417#true} is VALID [2018-11-23 11:23:41,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret15 := main(); {1417#true} is VALID [2018-11-23 11:23:41,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {1437#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:23:41,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {1437#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1437#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:23:41,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {1437#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1451#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:23:41,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {1451#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1451#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:23:41,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {1451#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1465#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:23:41,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {1465#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:23:41,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {1418#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:23:41,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:23:41,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:23:41,262 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {1418#false} is VALID [2018-11-23 11:23:41,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} ~nc_B~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:23:41,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {1418#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1418#false} is VALID [2018-11-23 11:23:41,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {1418#false} is VALID [2018-11-23 11:23:41,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {1418#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {1418#false} is VALID [2018-11-23 11:23:41,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {1418#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {1418#false} is VALID [2018-11-23 11:23:41,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {1418#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {1418#false} is VALID [2018-11-23 11:23:41,264 INFO L256 TraceCheckUtils]: 38: Hoare triple {1418#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 11:23:41,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 11:23:41,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 11:23:41,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 11:23:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:23:41,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:41,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 11:23:41,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 11:23:41,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 11:23:41,464 INFO L256 TraceCheckUtils]: 38: Hoare triple {1418#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 11:23:41,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {1418#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {1418#false} is VALID [2018-11-23 11:23:41,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {1418#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {1418#false} is VALID [2018-11-23 11:23:41,465 INFO L273 TraceCheckUtils]: 35: Hoare triple {1418#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {1418#false} is VALID [2018-11-23 11:23:41,465 INFO L273 TraceCheckUtils]: 34: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {1418#false} is VALID [2018-11-23 11:23:41,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {1418#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1418#false} is VALID [2018-11-23 11:23:41,466 INFO L273 TraceCheckUtils]: 31: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} ~nc_B~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:23:41,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {1418#false} is VALID [2018-11-23 11:23:41,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:23:41,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:23:41,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:23:41,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:23:41,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:23:41,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {1418#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:23:41,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {1631#(bvslt main_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:23:41,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1631#(bvslt main_~i~0 (_ bv5 32))} is VALID [2018-11-23 11:23:41,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 11:23:41,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret15 := main(); {1417#true} is VALID [2018-11-23 11:23:41,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #107#return; {1417#true} is VALID [2018-11-23 11:23:41,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 11:23:41,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 11:23:41,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 11:23:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:23:41,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:41,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:23:41,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 11:23:41,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:41,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:23:41,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:41,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:23:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:23:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:23:41,609 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 12 states. [2018-11-23 11:23:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:43,724 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2018-11-23 11:23:43,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:23:43,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 11:23:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:23:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-23 11:23:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:23:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-23 11:23:43,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2018-11-23 11:23:43,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:43,930 INFO L225 Difference]: With dead ends: 105 [2018-11-23 11:23:43,930 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:23:43,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:23:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:23:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-11-23 11:23:43,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:43,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 51 states. [2018-11-23 11:23:43,962 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 51 states. [2018-11-23 11:23:43,962 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 51 states. [2018-11-23 11:23:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:43,965 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 11:23:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 11:23:43,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:43,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:43,967 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 73 states. [2018-11-23 11:23:43,967 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 73 states. [2018-11-23 11:23:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:43,970 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 11:23:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 11:23:43,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:43,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:43,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:43,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:23:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-23 11:23:43,974 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 42 [2018-11-23 11:23:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:43,975 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-23 11:23:43,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:23:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 11:23:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:23:43,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:43,976 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:43,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:43,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1777563849, now seen corresponding path program 2 times [2018-11-23 11:23:43,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:43,977 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:44,020 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:44,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:23:44,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:44,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:44,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {2050#true} call ULTIMATE.init(); {2050#true} is VALID [2018-11-23 11:23:44,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {2050#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2050#true} is VALID [2018-11-23 11:23:44,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {2050#true} assume true; {2050#true} is VALID [2018-11-23 11:23:44,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2050#true} {2050#true} #107#return; {2050#true} is VALID [2018-11-23 11:23:44,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {2050#true} call #t~ret15 := main(); {2050#true} is VALID [2018-11-23 11:23:44,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {2050#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:23:44,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:23:44,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:23:44,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:23:44,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:23:44,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:23:44,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:23:44,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:23:44,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:23:44,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:23:44,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:23:44,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {2050#true} assume !~bvslt32(~i~0, 5bv32); {2050#true} is VALID [2018-11-23 11:23:44,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {2050#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {2050#true} is VALID [2018-11-23 11:23:44,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {2050#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:23:44,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:23:44,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:23:44,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:23:44,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:23:44,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:23:44,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:23:44,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:23:44,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:23:44,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:23:44,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:23:44,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {2050#true} assume !~bvslt32(~i~0, 5bv32); {2050#true} is VALID [2018-11-23 11:23:44,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {2050#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {2050#true} is VALID [2018-11-23 11:23:44,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {2050#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:23:44,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {2050#true} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {2050#true} is VALID [2018-11-23 11:23:44,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {2050#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {2050#true} is VALID [2018-11-23 11:23:44,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {2050#true} ~nc_B~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:23:44,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {2050#true} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2050#true} is VALID [2018-11-23 11:23:44,337 INFO L273 TraceCheckUtils]: 36: Hoare triple {2050#true} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2050#true} is VALID [2018-11-23 11:23:44,337 INFO L273 TraceCheckUtils]: 37: Hoare triple {2050#true} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2050#true} is VALID [2018-11-23 11:23:44,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {2050#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {2050#true} is VALID [2018-11-23 11:23:44,350 INFO L273 TraceCheckUtils]: 39: Hoare triple {2050#true} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {2172#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0))} is VALID [2018-11-23 11:23:44,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {2172#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0))} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {2172#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0))} is VALID [2018-11-23 11:23:44,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {2172#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~i~0))} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {2179#(or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0))} is VALID [2018-11-23 11:23:44,389 INFO L256 TraceCheckUtils]: 42: Hoare triple {2179#(or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0))} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {2183#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:44,402 INFO L273 TraceCheckUtils]: 43: Hoare triple {2183#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2187#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:44,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {2187#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2051#false} is VALID [2018-11-23 11:23:44,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {2051#false} assume !false; {2051#false} is VALID [2018-11-23 11:23:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:23:44,418 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:44,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:23:44,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 11:23:44,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:44,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:23:44,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:44,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:23:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:23:44,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:23:44,562 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-11-23 11:23:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,022 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 11:23:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:23:45,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 11:23:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:23:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 11:23:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:23:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 11:23:45,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 11:23:45,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:45,103 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:23:45,104 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:23:45,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:23:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:23:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 11:23:45,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:45,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 11:23:45,151 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 11:23:45,152 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 11:23:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,155 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 11:23:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 11:23:45,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:45,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:45,156 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 11:23:45,156 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 11:23:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,158 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 11:23:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 11:23:45,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:45,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:45,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:45,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:23:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-23 11:23:45,161 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 46 [2018-11-23 11:23:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:45,161 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-23 11:23:45,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:23:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 11:23:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:23:45,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:45,163 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 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] [2018-11-23 11:23:45,163 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:45,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1835345178, now seen corresponding path program 1 times [2018-11-23 11:23:45,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:45,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:23:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:45,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:45,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {2464#true} call ULTIMATE.init(); {2464#true} is VALID [2018-11-23 11:23:45,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {2464#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2464#true} is VALID [2018-11-23 11:23:45,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {2464#true} assume true; {2464#true} is VALID [2018-11-23 11:23:45,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2464#true} {2464#true} #107#return; {2464#true} is VALID [2018-11-23 11:23:45,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {2464#true} call #t~ret15 := main(); {2464#true} is VALID [2018-11-23 11:23:45,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {2464#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {2464#true} is VALID [2018-11-23 11:23:45,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2464#true} is VALID [2018-11-23 11:23:45,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {2464#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2464#true} is VALID [2018-11-23 11:23:45,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2464#true} is VALID [2018-11-23 11:23:45,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {2464#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2464#true} is VALID [2018-11-23 11:23:45,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2464#true} is VALID [2018-11-23 11:23:45,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {2464#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2464#true} is VALID [2018-11-23 11:23:45,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2464#true} is VALID [2018-11-23 11:23:45,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {2464#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2464#true} is VALID [2018-11-23 11:23:45,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2464#true} is VALID [2018-11-23 11:23:45,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {2464#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2464#true} is VALID [2018-11-23 11:23:45,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {2464#true} assume !~bvslt32(~i~0, 5bv32); {2464#true} is VALID [2018-11-23 11:23:45,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {2464#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {2464#true} is VALID [2018-11-23 11:23:45,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {2464#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {2464#true} is VALID [2018-11-23 11:23:45,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2464#true} is VALID [2018-11-23 11:23:45,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {2464#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2464#true} is VALID [2018-11-23 11:23:45,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2464#true} is VALID [2018-11-23 11:23:45,382 INFO L273 TraceCheckUtils]: 22: Hoare triple {2464#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2464#true} is VALID [2018-11-23 11:23:45,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2464#true} is VALID [2018-11-23 11:23:45,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {2464#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2464#true} is VALID [2018-11-23 11:23:45,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2464#true} is VALID [2018-11-23 11:23:45,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {2464#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2464#true} is VALID [2018-11-23 11:23:45,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2464#true} is VALID [2018-11-23 11:23:45,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2464#true} is VALID [2018-11-23 11:23:45,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#true} assume !~bvslt32(~i~0, 5bv32); {2464#true} is VALID [2018-11-23 11:23:45,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {2464#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {2464#true} is VALID [2018-11-23 11:23:45,385 INFO L273 TraceCheckUtils]: 31: Hoare triple {2464#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} ~nc_B~0 := 0bv32; {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {2562#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:45,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {2562#(= main_~nc_A~0 (_ bv0 32))} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {2587#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:45,390 INFO L273 TraceCheckUtils]: 40: Hoare triple {2587#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0));call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); {2465#false} is VALID [2018-11-23 11:23:45,390 INFO L273 TraceCheckUtils]: 41: Hoare triple {2465#false} assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12);havoc #t~mem12;havoc #t~mem11;#t~post13 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post13);havoc #t~post13;#t~post14 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2465#false} is VALID [2018-11-23 11:23:45,390 INFO L273 TraceCheckUtils]: 42: Hoare triple {2465#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {2465#false} is VALID [2018-11-23 11:23:45,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {2465#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {2465#false} is VALID [2018-11-23 11:23:45,390 INFO L256 TraceCheckUtils]: 44: Hoare triple {2465#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {2465#false} is VALID [2018-11-23 11:23:45,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {2465#false} ~cond := #in~cond; {2465#false} is VALID [2018-11-23 11:23:45,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {2465#false} assume 0bv32 == ~cond; {2465#false} is VALID [2018-11-23 11:23:45,391 INFO L273 TraceCheckUtils]: 47: Hoare triple {2465#false} assume !false; {2465#false} is VALID [2018-11-23 11:23:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:23:45,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:23:45,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-23 11:23:45,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:45,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:23:45,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:45,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:23:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:23:45,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:45,443 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 4 states. [2018-11-23 11:23:45,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,676 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 11:23:45,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:23:45,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-23 11:23:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 11:23:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 11:23:45,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-23 11:23:45,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:45,893 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:23:45,893 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:23:45,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:23:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 11:23:45,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:45,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 11:23:45,941 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 11:23:45,941 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 11:23:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,943 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 11:23:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 11:23:45,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:45,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:45,943 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 11:23:45,943 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 11:23:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,945 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 11:23:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 11:23:45,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:45,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:45,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:45,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:23:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 11:23:45,948 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 48 [2018-11-23 11:23:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:45,948 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 11:23:45,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:23:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 11:23:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:23:45,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:45,949 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 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] [2018-11-23 11:23:45,949 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:45,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:45,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1547819580, now seen corresponding path program 1 times [2018-11-23 11:23:45,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:45,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:45,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:46,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:46,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {2874#true} call ULTIMATE.init(); {2874#true} is VALID [2018-11-23 11:23:46,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {2874#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2874#true} is VALID [2018-11-23 11:23:46,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {2874#true} assume true; {2874#true} is VALID [2018-11-23 11:23:46,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2874#true} {2874#true} #107#return; {2874#true} is VALID [2018-11-23 11:23:46,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {2874#true} call #t~ret15 := main(); {2874#true} is VALID [2018-11-23 11:23:46,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {2874#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {2874#true} is VALID [2018-11-23 11:23:46,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 15: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {2874#true} assume !~bvslt32(~i~0, 5bv32); {2874#true} is VALID [2018-11-23 11:23:46,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {2874#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {2874#true} is VALID [2018-11-23 11:23:46,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {2874#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {2874#true} is VALID [2018-11-23 11:23:46,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {2874#true} assume !~bvslt32(~i~0, 5bv32); {2874#true} is VALID [2018-11-23 11:23:46,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {2874#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {2874#true} is VALID [2018-11-23 11:23:46,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {2874#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {2972#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:46,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {2972#(= main_~nc_A~0 (_ bv0 32))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {2972#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:23:46,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {2972#(= main_~nc_A~0 (_ bv0 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7;#t~post8 := ~nc_A~0;~nc_A~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2979#(= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:46,246 INFO L273 TraceCheckUtils]: 34: Hoare triple {2979#(= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {2979#(= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:46,248 INFO L273 TraceCheckUtils]: 35: Hoare triple {2979#(= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {2979#(= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:46,248 INFO L273 TraceCheckUtils]: 36: Hoare triple {2979#(= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32))} ~nc_B~0 := 0bv32; {2989#(and (= main_~nc_B~0 (_ bv0 32)) (= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,249 INFO L273 TraceCheckUtils]: 37: Hoare triple {2989#(and (= main_~nc_B~0 (_ bv0 32)) (= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2989#(and (= main_~nc_B~0 (_ bv0 32)) (= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,249 INFO L273 TraceCheckUtils]: 38: Hoare triple {2989#(and (= main_~nc_B~0 (_ bv0 32)) (= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {2989#(and (= main_~nc_B~0 (_ bv0 32)) (= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {2989#(and (= main_~nc_B~0 (_ bv0 32)) (= (bvadd main_~nc_A~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {2875#false} is VALID [2018-11-23 11:23:46,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {2875#false} assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0));call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); {2875#false} is VALID [2018-11-23 11:23:46,250 INFO L273 TraceCheckUtils]: 41: Hoare triple {2875#false} assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12);havoc #t~mem12;havoc #t~mem11;#t~post13 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post13);havoc #t~post13;#t~post14 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2875#false} is VALID [2018-11-23 11:23:46,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {2875#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {2875#false} is VALID [2018-11-23 11:23:46,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {2875#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {2875#false} is VALID [2018-11-23 11:23:46,250 INFO L256 TraceCheckUtils]: 44: Hoare triple {2875#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {2875#false} is VALID [2018-11-23 11:23:46,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {2875#false} ~cond := #in~cond; {2875#false} is VALID [2018-11-23 11:23:46,251 INFO L273 TraceCheckUtils]: 46: Hoare triple {2875#false} assume 0bv32 == ~cond; {2875#false} is VALID [2018-11-23 11:23:46,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {2875#false} assume !false; {2875#false} is VALID [2018-11-23 11:23:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 11:23:46,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:46,338 INFO L273 TraceCheckUtils]: 47: Hoare triple {2875#false} assume !false; {2875#false} is VALID [2018-11-23 11:23:46,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {2875#false} assume 0bv32 == ~cond; {2875#false} is VALID [2018-11-23 11:23:46,339 INFO L273 TraceCheckUtils]: 45: Hoare triple {2875#false} ~cond := #in~cond; {2875#false} is VALID [2018-11-23 11:23:46,339 INFO L256 TraceCheckUtils]: 44: Hoare triple {2875#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {2875#false} is VALID [2018-11-23 11:23:46,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {2875#false} ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); {2875#false} is VALID [2018-11-23 11:23:46,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {2875#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {2875#false} is VALID [2018-11-23 11:23:46,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {2875#false} assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12);havoc #t~mem12;havoc #t~mem11;#t~post13 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post13);havoc #t~post13;#t~post14 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2875#false} is VALID [2018-11-23 11:23:46,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {2875#false} assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0));call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); {2875#false} is VALID [2018-11-23 11:23:46,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {3047#(not (bvsge main_~nc_B~0 main_~nc_A~0))} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {2875#false} is VALID [2018-11-23 11:23:46,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {3047#(not (bvsge main_~nc_B~0 main_~nc_A~0))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {3047#(not (bvsge main_~nc_B~0 main_~nc_A~0))} is VALID [2018-11-23 11:23:46,341 INFO L273 TraceCheckUtils]: 37: Hoare triple {3047#(not (bvsge main_~nc_B~0 main_~nc_A~0))} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {3047#(not (bvsge main_~nc_B~0 main_~nc_A~0))} is VALID [2018-11-23 11:23:46,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {3057#(not (bvsge (_ bv0 32) main_~nc_A~0))} ~nc_B~0 := 0bv32; {3047#(not (bvsge main_~nc_B~0 main_~nc_A~0))} is VALID [2018-11-23 11:23:46,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {3057#(not (bvsge (_ bv0 32) main_~nc_A~0))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {3057#(not (bvsge (_ bv0 32) main_~nc_A~0))} is VALID [2018-11-23 11:23:46,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {3057#(not (bvsge (_ bv0 32) main_~nc_A~0))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {3057#(not (bvsge (_ bv0 32) main_~nc_A~0))} is VALID [2018-11-23 11:23:46,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {3067#(not (bvsge (_ bv0 32) (bvadd main_~nc_A~0 (_ bv1 32))))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7;#t~post8 := ~nc_A~0;~nc_A~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3057#(not (bvsge (_ bv0 32) main_~nc_A~0))} is VALID [2018-11-23 11:23:46,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {3067#(not (bvsge (_ bv0 32) (bvadd main_~nc_A~0 (_ bv1 32))))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {3067#(not (bvsge (_ bv0 32) (bvadd main_~nc_A~0 (_ bv1 32))))} is VALID [2018-11-23 11:23:46,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {2874#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {3067#(not (bvsge (_ bv0 32) (bvadd main_~nc_A~0 (_ bv1 32))))} is VALID [2018-11-23 11:23:46,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {2874#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {2874#true} is VALID [2018-11-23 11:23:46,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {2874#true} assume !~bvslt32(~i~0, 5bv32); {2874#true} is VALID [2018-11-23 11:23:46,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {2874#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2874#true} is VALID [2018-11-23 11:23:46,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2874#true} is VALID [2018-11-23 11:23:46,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {2874#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {2874#true} is VALID [2018-11-23 11:23:46,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {2874#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {2874#true} assume !~bvslt32(~i~0, 5bv32); {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {2874#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {2874#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {2874#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {2874#true} call #t~ret15 := main(); {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2874#true} {2874#true} #107#return; {2874#true} is VALID [2018-11-23 11:23:46,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {2874#true} assume true; {2874#true} is VALID [2018-11-23 11:23:46,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {2874#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2874#true} is VALID [2018-11-23 11:23:46,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {2874#true} call ULTIMATE.init(); {2874#true} is VALID [2018-11-23 11:23:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 11:23:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:23:46,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 11:23:46,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:46,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:23:46,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:46,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:23:46,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:23:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:23:46,429 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-11-23 11:23:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,099 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2018-11-23 11:23:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:23:47,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 11:23:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:23:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2018-11-23 11:23:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:23:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2018-11-23 11:23:47,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2018-11-23 11:23:47,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:47,335 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:23:47,335 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:23:47,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:23:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:23:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2018-11-23 11:23:47,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:47,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 58 states. [2018-11-23 11:23:47,432 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 58 states. [2018-11-23 11:23:47,432 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 58 states. [2018-11-23 11:23:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,436 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-23 11:23:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2018-11-23 11:23:47,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:47,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:47,437 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 88 states. [2018-11-23 11:23:47,437 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 88 states. [2018-11-23 11:23:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,440 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-23 11:23:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2018-11-23 11:23:47,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:47,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:47,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:47,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:23:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-23 11:23:47,443 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 48 [2018-11-23 11:23:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:47,444 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-23 11:23:47,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:23:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-23 11:23:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:23:47,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:47,445 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:47,445 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:47,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -915073569, now seen corresponding path program 1 times [2018-11-23 11:23:47,446 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:47,446 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:47,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:23:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (10)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:23:48,020 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #107#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret15 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !~bvslt32(~i~0, 5bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem3|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !~bvslt32(~i~0, 5bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem6|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv1 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7;#t~post8 := ~nc_A~0;~nc_A~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] ~nc_B~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem9|=(_ bv1 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem9|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv0 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0));call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv0 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem11|=(_ bv1 8), |main_#t~mem12|=(_ bv1 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12);havoc #t~mem12;havoc #t~mem11;#t~post13 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post13);havoc #t~post13;#t~post14 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [main_~found~0=(_ bv2 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3)); [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6)); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] assume !!~bvsge32(~nc_B~0, ~nc_A~0); [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); [L43] call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L43] call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43-L52] assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12); [L43] havoc #t~mem12; [L43] havoc #t~mem11; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3)); [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6)); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] assume !!~bvsge32(~nc_B~0, ~nc_A~0); [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); [L43] call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L43] call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43-L52] assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12); [L43] havoc #t~mem12; [L43] havoc #t~mem11; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem12; [L43] havoc #t~mem11; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem12; [L43] havoc #t~mem11; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem12; [L43] havoc #t~mem11; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem12; [L43] havoc #t~mem11; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=1, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=2, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=3, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=4, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L21] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L23] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={3:0}, string_A[5 -1]=0, string_B={2:0}] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=1, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=2, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=3, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=4, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L25] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L27] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={3:0}, string_B={2:0}, string_B[5 -1]=0] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_B={2:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_A[nc_A]=1, string_B={2:0}] [L30] COND TRUE string_A[nc_A]!='\0' [L31] nc_A++ VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_B={2:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_A[nc_A]=0, string_B={2:0}] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={2:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={2:0}, string_B[nc_B]=1] [L34] COND TRUE string_B[nc_B]!='\0' [L35] nc_B++ VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}, string_B[nc_B]=0] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L41] COND TRUE (inc_B-1)<= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L41] COND TRUE (inc_B-1)<= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L41] COND TRUE (inc_B-1)<