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_Default.epf -i ../../../trunk/examples/svcomp/loops/string_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:35,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:35,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:35,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:35,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:35,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:35,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:35,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:35,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:35,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:35,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:35,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:35,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:35,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:35,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:35,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:35,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:35,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:35,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:35,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:35,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:35,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:35,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:35,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:35,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:35,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:35,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:35,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:35,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:35,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:35,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:35,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:35,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:35,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:35,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:35,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:35,168 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:35,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:35,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:35,197 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:35,197 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:35,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:35,198 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:35,198 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:35,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:35,199 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:35,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:35,199 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:35,199 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:35,199 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:35,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:35,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:35,201 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:35,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:35,201 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:35,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:35,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:35,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:35,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:35,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:35,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:35,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:35,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:35,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:35,205 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:35,205 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:35,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:35,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:35,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:35,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:35,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:35,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:35,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:35,299 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 13:02:35,357 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26319256a/350201fcf04e46869c38c968a8ac9618/FLAGd41cf91e5 [2018-11-23 13:02:35,754 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:35,755 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_false-unreach-call_true-termination.i [2018-11-23 13:02:35,762 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26319256a/350201fcf04e46869c38c968a8ac9618/FLAGd41cf91e5 [2018-11-23 13:02:36,201 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26319256a/350201fcf04e46869c38c968a8ac9618 [2018-11-23 13:02:36,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:36,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:36,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:36,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:36,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:36,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9155e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36, skipping insertion in model container [2018-11-23 13:02:36,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:36,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:36,519 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:36,525 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:36,579 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:36,608 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:36,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36 WrapperNode [2018-11-23 13:02:36,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:36,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:36,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:36,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:36,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:36,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:36,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:36,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:36,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (1/1) ... [2018-11-23 13:02:36,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:36,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:36,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:36,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:36,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (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 13:02:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:02:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:36,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:02:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:36,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:36,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:02:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:36,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:36,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:36,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:02:37,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:37,689 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:02:37,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:37 BoogieIcfgContainer [2018-11-23 13:02:37,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:37,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:37,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:37,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:37,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:36" (1/3) ... [2018-11-23 13:02:37,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ae79e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:37, skipping insertion in model container [2018-11-23 13:02:37,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:36" (2/3) ... [2018-11-23 13:02:37,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ae79e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:37, skipping insertion in model container [2018-11-23 13:02:37,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:37" (3/3) ... [2018-11-23 13:02:37,700 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-23 13:02:37,711 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:37,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:37,741 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:37,779 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:37,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:37,780 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:37,780 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:37,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:37,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:37,781 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:37,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:37,782 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 13:02:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:02:37,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:37,811 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 13:02:37,814 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:37,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 13:02:37,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:37,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:37,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:37,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:37,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:37,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 13:02:37,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38#true} is VALID [2018-11-23 13:02:37,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 13:02:37,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2018-11-23 13:02:37,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2018-11-23 13:02:37,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {38#true} is VALID [2018-11-23 13:02:37,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 13:02:37,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {39#false} is VALID [2018-11-23 13:02:37,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {39#false} is VALID [2018-11-23 13:02:37,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:02:37,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {39#false} is VALID [2018-11-23 13:02:37,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {39#false} is VALID [2018-11-23 13:02:37,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:02:37,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2018-11-23 13:02:37,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:02:37,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {39#false} is VALID [2018-11-23 13:02:37,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:02:37,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {39#false} is VALID [2018-11-23 13:02:37,990 INFO L256 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {39#false} is VALID [2018-11-23 13:02:37,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 13:02:37,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2018-11-23 13:02:37,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 13:02:37,995 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 13:02:37,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:37,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:38,004 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 13:02:38,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:38,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:38,145 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 13:02:38,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:38,156 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 13:02:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:38,518 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 13:02:38,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:38,519 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 13:02:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 13:02:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 13:02:38,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2018-11-23 13:02:38,796 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 13:02:38,809 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:02:38,809 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:02:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:02:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:02:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:02:38,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:38,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:02:38,872 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:02:38,872 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:02:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:38,877 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:02:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:02:38,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:38,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:38,878 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:02:38,879 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:02:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:38,883 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:02:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:02:38,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:38,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:38,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:38,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:02:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 13:02:38,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 13:02:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:38,890 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 13:02:38,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:02:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:02:38,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:38,892 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 13:02:38,892 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:38,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 13:02:38,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:38,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:38,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:39,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 13:02:39,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {216#true} is VALID [2018-11-23 13:02:39,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 13:02:39,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #107#return; {216#true} is VALID [2018-11-23 13:02:39,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret15 := main(); {216#true} is VALID [2018-11-23 13:02:39,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {218#(= main_~i~0 0)} is VALID [2018-11-23 13:02:39,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {218#(= main_~i~0 0)} assume !(~i~0 < 5); {217#false} is VALID [2018-11-23 13:02:39,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {217#false} is VALID [2018-11-23 13:02:39,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {217#false} is VALID [2018-11-23 13:02:39,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#false} assume !(~i~0 < 5); {217#false} is VALID [2018-11-23 13:02:39,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {217#false} is VALID [2018-11-23 13:02:39,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {217#false} is VALID [2018-11-23 13:02:39,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {217#false} is VALID [2018-11-23 13:02:39,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume !(0 != #t~mem7);havoc #t~mem7; {217#false} is VALID [2018-11-23 13:02:39,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#false} ~nc_B~0 := 0; {217#false} is VALID [2018-11-23 13:02:39,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {217#false} is VALID [2018-11-23 13:02:39,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {217#false} assume !(0 != #t~mem9);havoc #t~mem9; {217#false} is VALID [2018-11-23 13:02:39,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {217#false} is VALID [2018-11-23 13:02:39,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {217#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {217#false} is VALID [2018-11-23 13:02:39,020 INFO L273 TraceCheckUtils]: 19: Hoare triple {217#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {217#false} is VALID [2018-11-23 13:02:39,021 INFO L256 TraceCheckUtils]: 20: Hoare triple {217#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {217#false} is VALID [2018-11-23 13:02:39,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {217#false} ~cond := #in~cond; {217#false} is VALID [2018-11-23 13:02:39,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {217#false} assume 0 == ~cond; {217#false} is VALID [2018-11-23 13:02:39,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 13:02:39,024 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 13:02:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:39,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:02:39,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 13:02:39,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:39,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:02:39,310 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 13:02:39,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:02:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:02:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:02:39,312 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 13:02:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:39,711 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 13:02:39,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:02:39,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 13:02:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:02:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 13:02:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:02:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 13:02:39,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 13:02:39,881 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 13:02:39,883 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:02:39,884 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:02:39,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:02:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:02:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 13:02:39,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:39,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-23 13:02:39,907 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-23 13:02:39,907 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-23 13:02:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:39,911 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:02:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:02:39,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:39,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:39,913 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-23 13:02:39,913 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-23 13:02:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:39,916 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:02:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:02:39,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:39,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:39,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:39,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:02:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 13:02:39,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 13:02:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:39,921 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 13:02:39,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:02:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 13:02:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:02:39,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:39,922 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 13:02:39,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:39,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 13:02:39,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:39,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:40,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {413#true} is VALID [2018-11-23 13:02:40,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {413#true} is VALID [2018-11-23 13:02:40,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2018-11-23 13:02:40,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #107#return; {413#true} is VALID [2018-11-23 13:02:40,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret15 := main(); {413#true} is VALID [2018-11-23 13:02:40,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {415#(= main_~i~0 0)} is VALID [2018-11-23 13:02:40,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {415#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {415#(= main_~i~0 0)} is VALID [2018-11-23 13:02:40,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {415#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {416#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:40,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {416#(<= main_~i~0 1)} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:02:40,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {414#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {414#false} is VALID [2018-11-23 13:02:40,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {414#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {414#false} is VALID [2018-11-23 13:02:40,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {414#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {414#false} is VALID [2018-11-23 13:02:40,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {414#false} is VALID [2018-11-23 13:02:40,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {414#false} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:02:40,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {414#false} is VALID [2018-11-23 13:02:40,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {414#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {414#false} is VALID [2018-11-23 13:02:40,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {414#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {414#false} is VALID [2018-11-23 13:02:40,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {414#false} assume !(0 != #t~mem7);havoc #t~mem7; {414#false} is VALID [2018-11-23 13:02:40,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {414#false} ~nc_B~0 := 0; {414#false} is VALID [2018-11-23 13:02:40,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {414#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {414#false} is VALID [2018-11-23 13:02:40,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {414#false} assume !(0 != #t~mem9);havoc #t~mem9; {414#false} is VALID [2018-11-23 13:02:40,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {414#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {414#false} is VALID [2018-11-23 13:02:40,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {414#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {414#false} is VALID [2018-11-23 13:02:40,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {414#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {414#false} is VALID [2018-11-23 13:02:40,089 INFO L256 TraceCheckUtils]: 24: Hoare triple {414#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {414#false} is VALID [2018-11-23 13:02:40,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2018-11-23 13:02:40,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2018-11-23 13:02:40,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {414#false} assume !false; {414#false} is VALID [2018-11-23 13:02:40,091 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 13:02:40,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:40,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:40,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:40,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:40,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {413#true} is VALID [2018-11-23 13:02:40,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {413#true} is VALID [2018-11-23 13:02:40,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2018-11-23 13:02:40,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #107#return; {413#true} is VALID [2018-11-23 13:02:40,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret15 := main(); {413#true} is VALID [2018-11-23 13:02:40,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {435#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:40,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {435#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {435#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:40,502 INFO L273 TraceCheckUtils]: 7: Hoare triple {435#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {416#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:40,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {416#(<= main_~i~0 1)} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:02:40,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {414#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {414#false} is VALID [2018-11-23 13:02:40,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {414#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {414#false} is VALID [2018-11-23 13:02:40,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {414#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {414#false} is VALID [2018-11-23 13:02:40,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {414#false} is VALID [2018-11-23 13:02:40,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {414#false} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:02:40,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {414#false} is VALID [2018-11-23 13:02:40,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {414#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {414#false} is VALID [2018-11-23 13:02:40,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {414#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {414#false} is VALID [2018-11-23 13:02:40,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {414#false} assume !(0 != #t~mem7);havoc #t~mem7; {414#false} is VALID [2018-11-23 13:02:40,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {414#false} ~nc_B~0 := 0; {414#false} is VALID [2018-11-23 13:02:40,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {414#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {414#false} is VALID [2018-11-23 13:02:40,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {414#false} assume !(0 != #t~mem9);havoc #t~mem9; {414#false} is VALID [2018-11-23 13:02:40,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {414#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {414#false} is VALID [2018-11-23 13:02:40,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {414#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {414#false} is VALID [2018-11-23 13:02:40,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {414#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {414#false} is VALID [2018-11-23 13:02:40,508 INFO L256 TraceCheckUtils]: 24: Hoare triple {414#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {414#false} is VALID [2018-11-23 13:02:40,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2018-11-23 13:02:40,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2018-11-23 13:02:40,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {414#false} assume !false; {414#false} is VALID [2018-11-23 13:02:40,510 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 13:02:40,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:40,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:02:40,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 13:02:40,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:40,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:40,672 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 13:02:40,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:40,673 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 13:02:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:41,018 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 13:02:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:41,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 13:02:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 13:02:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 13:02:41,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-23 13:02:41,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:41,211 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:02:41,211 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:02:41,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:02:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-23 13:02:41,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:41,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2018-11-23 13:02:41,227 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2018-11-23 13:02:41,227 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2018-11-23 13:02:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:41,232 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:02:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:02:41,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:41,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:41,233 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2018-11-23 13:02:41,233 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2018-11-23 13:02:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:41,237 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:02:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:02:41,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:41,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:41,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:41,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:02:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 13:02:41,240 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2018-11-23 13:02:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:41,241 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 13:02:41,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:02:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:02:41,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:41,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:41,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:41,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1752396196, now seen corresponding path program 2 times [2018-11-23 13:02:41,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:41,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:41,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2018-11-23 13:02:41,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {729#true} is VALID [2018-11-23 13:02:41,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-23 13:02:41,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #107#return; {729#true} is VALID [2018-11-23 13:02:41,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {729#true} call #t~ret15 := main(); {729#true} is VALID [2018-11-23 13:02:41,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {731#(= main_~i~0 0)} is VALID [2018-11-23 13:02:41,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {731#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {731#(= main_~i~0 0)} is VALID [2018-11-23 13:02:41,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {731#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {732#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:41,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {732#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:41,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {732#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {733#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:41,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(<= main_~i~0 2)} assume !(~i~0 < 5); {730#false} is VALID [2018-11-23 13:02:41,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {730#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {730#false} is VALID [2018-11-23 13:02:41,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {730#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {730#false} is VALID [2018-11-23 13:02:41,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {730#false} is VALID [2018-11-23 13:02:41,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {730#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {730#false} is VALID [2018-11-23 13:02:41,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {730#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {730#false} is VALID [2018-11-23 13:02:41,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {730#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {730#false} is VALID [2018-11-23 13:02:41,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {730#false} assume !(~i~0 < 5); {730#false} is VALID [2018-11-23 13:02:41,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {730#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {730#false} is VALID [2018-11-23 13:02:41,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {730#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {730#false} is VALID [2018-11-23 13:02:41,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {730#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {730#false} is VALID [2018-11-23 13:02:41,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {730#false} assume !(0 != #t~mem7);havoc #t~mem7; {730#false} is VALID [2018-11-23 13:02:41,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {730#false} ~nc_B~0 := 0; {730#false} is VALID [2018-11-23 13:02:41,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {730#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {730#false} is VALID [2018-11-23 13:02:41,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {730#false} assume !(0 != #t~mem9);havoc #t~mem9; {730#false} is VALID [2018-11-23 13:02:41,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {730#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {730#false} is VALID [2018-11-23 13:02:41,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {730#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {730#false} is VALID [2018-11-23 13:02:41,394 INFO L273 TraceCheckUtils]: 27: Hoare triple {730#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {730#false} is VALID [2018-11-23 13:02:41,395 INFO L256 TraceCheckUtils]: 28: Hoare triple {730#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {730#false} is VALID [2018-11-23 13:02:41,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {730#false} ~cond := #in~cond; {730#false} is VALID [2018-11-23 13:02:41,395 INFO L273 TraceCheckUtils]: 30: Hoare triple {730#false} assume 0 == ~cond; {730#false} is VALID [2018-11-23 13:02:41,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {730#false} assume !false; {730#false} is VALID [2018-11-23 13:02:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:02:41,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:41,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:41,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:41,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:41,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:41,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:41,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2018-11-23 13:02:41,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {729#true} is VALID [2018-11-23 13:02:41,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-23 13:02:41,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #107#return; {729#true} is VALID [2018-11-23 13:02:41,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {729#true} call #t~ret15 := main(); {729#true} is VALID [2018-11-23 13:02:41,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {752#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:41,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {752#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {752#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:41,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {752#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {732#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:41,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {732#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:41,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {732#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {733#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:41,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(<= main_~i~0 2)} assume !(~i~0 < 5); {730#false} is VALID [2018-11-23 13:02:41,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {730#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {730#false} is VALID [2018-11-23 13:02:41,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {730#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {730#false} is VALID [2018-11-23 13:02:41,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {730#false} is VALID [2018-11-23 13:02:41,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {730#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {730#false} is VALID [2018-11-23 13:02:41,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {730#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {730#false} is VALID [2018-11-23 13:02:41,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {730#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {730#false} is VALID [2018-11-23 13:02:41,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {730#false} assume !(~i~0 < 5); {730#false} is VALID [2018-11-23 13:02:41,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {730#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {730#false} is VALID [2018-11-23 13:02:41,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {730#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {730#false} is VALID [2018-11-23 13:02:41,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {730#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {730#false} is VALID [2018-11-23 13:02:41,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {730#false} assume !(0 != #t~mem7);havoc #t~mem7; {730#false} is VALID [2018-11-23 13:02:41,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {730#false} ~nc_B~0 := 0; {730#false} is VALID [2018-11-23 13:02:41,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {730#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {730#false} is VALID [2018-11-23 13:02:41,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {730#false} assume !(0 != #t~mem9);havoc #t~mem9; {730#false} is VALID [2018-11-23 13:02:41,628 INFO L273 TraceCheckUtils]: 25: Hoare triple {730#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {730#false} is VALID [2018-11-23 13:02:41,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {730#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {730#false} is VALID [2018-11-23 13:02:41,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {730#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {730#false} is VALID [2018-11-23 13:02:41,629 INFO L256 TraceCheckUtils]: 28: Hoare triple {730#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {730#false} is VALID [2018-11-23 13:02:41,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {730#false} ~cond := #in~cond; {730#false} is VALID [2018-11-23 13:02:41,630 INFO L273 TraceCheckUtils]: 30: Hoare triple {730#false} assume 0 == ~cond; {730#false} is VALID [2018-11-23 13:02:41,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {730#false} assume !false; {730#false} is VALID [2018-11-23 13:02:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:02:41,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:41,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:02:41,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 13:02:41,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:41,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:02:41,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:41,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:02:41,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:02:41,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:41,753 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2018-11-23 13:02:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:42,029 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-23 13:02:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:42,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 13:02:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-23 13:02:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-23 13:02:42,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2018-11-23 13:02:42,204 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 13:02:42,207 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:02:42,207 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:02:42,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:02:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-23 13:02:42,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:42,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 38 states. [2018-11-23 13:02:42,240 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 38 states. [2018-11-23 13:02:42,240 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 38 states. [2018-11-23 13:02:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:42,243 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 13:02:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 13:02:42,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:42,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:42,245 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 52 states. [2018-11-23 13:02:42,245 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 52 states. [2018-11-23 13:02:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:42,248 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 13:02:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 13:02:42,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:42,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:42,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:42,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:02:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 13:02:42,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2018-11-23 13:02:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:42,253 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 13:02:42,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:02:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 13:02:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:02:42,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:42,254 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 13:02:42,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:42,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash -800948324, now seen corresponding path program 3 times [2018-11-23 13:02:42,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:42,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:42,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:42,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:42,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:42,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {1095#true} call ULTIMATE.init(); {1095#true} is VALID [2018-11-23 13:02:42,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {1095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1095#true} is VALID [2018-11-23 13:02:42,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {1095#true} assume true; {1095#true} is VALID [2018-11-23 13:02:42,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1095#true} {1095#true} #107#return; {1095#true} is VALID [2018-11-23 13:02:42,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {1095#true} call #t~ret15 := main(); {1095#true} is VALID [2018-11-23 13:02:42,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {1095#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1097#(= main_~i~0 0)} is VALID [2018-11-23 13:02:42,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {1097#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1097#(= main_~i~0 0)} is VALID [2018-11-23 13:02:42,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {1097#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1098#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:42,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {1098#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1098#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:42,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {1098#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1099#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:42,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {1099#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1099#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:42,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {1099#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1100#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:42,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {1100#(<= main_~i~0 3)} assume !(~i~0 < 5); {1096#false} is VALID [2018-11-23 13:02:42,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {1096#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1096#false} is VALID [2018-11-23 13:02:42,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {1096#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1096#false} is VALID [2018-11-23 13:02:42,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {1096#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1096#false} is VALID [2018-11-23 13:02:42,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {1096#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1096#false} is VALID [2018-11-23 13:02:42,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {1096#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1096#false} is VALID [2018-11-23 13:02:42,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {1096#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1096#false} is VALID [2018-11-23 13:02:42,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {1096#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1096#false} is VALID [2018-11-23 13:02:42,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {1096#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1096#false} is VALID [2018-11-23 13:02:42,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {1096#false} assume !(~i~0 < 5); {1096#false} is VALID [2018-11-23 13:02:42,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {1096#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1096#false} is VALID [2018-11-23 13:02:42,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {1096#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1096#false} is VALID [2018-11-23 13:02:42,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {1096#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1096#false} is VALID [2018-11-23 13:02:42,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {1096#false} assume !(0 != #t~mem7);havoc #t~mem7; {1096#false} is VALID [2018-11-23 13:02:42,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {1096#false} ~nc_B~0 := 0; {1096#false} is VALID [2018-11-23 13:02:42,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {1096#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1096#false} is VALID [2018-11-23 13:02:42,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {1096#false} assume !(0 != #t~mem9);havoc #t~mem9; {1096#false} is VALID [2018-11-23 13:02:42,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {1096#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1096#false} is VALID [2018-11-23 13:02:42,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {1096#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1096#false} is VALID [2018-11-23 13:02:42,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {1096#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1096#false} is VALID [2018-11-23 13:02:42,418 INFO L256 TraceCheckUtils]: 32: Hoare triple {1096#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1096#false} is VALID [2018-11-23 13:02:42,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {1096#false} ~cond := #in~cond; {1096#false} is VALID [2018-11-23 13:02:42,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {1096#false} assume 0 == ~cond; {1096#false} is VALID [2018-11-23 13:02:42,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {1096#false} assume !false; {1096#false} is VALID [2018-11-23 13:02:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:02:42,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:42,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:02:42,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:02:42,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:42,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:42,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {1095#true} call ULTIMATE.init(); {1095#true} is VALID [2018-11-23 13:02:42,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {1095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1095#true} is VALID [2018-11-23 13:02:42,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {1095#true} assume true; {1095#true} is VALID [2018-11-23 13:02:42,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1095#true} {1095#true} #107#return; {1095#true} is VALID [2018-11-23 13:02:42,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {1095#true} call #t~ret15 := main(); {1095#true} is VALID [2018-11-23 13:02:42,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {1095#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1095#true} is VALID [2018-11-23 13:02:42,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {1095#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1095#true} is VALID [2018-11-23 13:02:42,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {1095#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#true} is VALID [2018-11-23 13:02:42,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {1095#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1095#true} is VALID [2018-11-23 13:02:42,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {1095#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#true} is VALID [2018-11-23 13:02:42,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {1095#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1095#true} is VALID [2018-11-23 13:02:42,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {1095#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#true} is VALID [2018-11-23 13:02:42,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {1095#true} assume !(~i~0 < 5); {1095#true} is VALID [2018-11-23 13:02:42,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {1095#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1095#true} is VALID [2018-11-23 13:02:42,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {1095#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1146#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:42,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {1146#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1146#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:42,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {1146#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1098#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:42,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {1098#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1098#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:42,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {1098#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1099#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:42,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {1099#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1099#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:42,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {1099#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1100#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:42,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {1100#(<= main_~i~0 3)} assume !(~i~0 < 5); {1096#false} is VALID [2018-11-23 13:02:42,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {1096#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1096#false} is VALID [2018-11-23 13:02:42,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {1096#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1096#false} is VALID [2018-11-23 13:02:42,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {1096#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1096#false} is VALID [2018-11-23 13:02:42,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {1096#false} assume !(0 != #t~mem7);havoc #t~mem7; {1096#false} is VALID [2018-11-23 13:02:42,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {1096#false} ~nc_B~0 := 0; {1096#false} is VALID [2018-11-23 13:02:42,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {1096#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1096#false} is VALID [2018-11-23 13:02:42,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {1096#false} assume !(0 != #t~mem9);havoc #t~mem9; {1096#false} is VALID [2018-11-23 13:02:42,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {1096#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1096#false} is VALID [2018-11-23 13:02:42,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {1096#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1096#false} is VALID [2018-11-23 13:02:42,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {1096#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1096#false} is VALID [2018-11-23 13:02:42,669 INFO L256 TraceCheckUtils]: 32: Hoare triple {1096#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1096#false} is VALID [2018-11-23 13:02:42,669 INFO L273 TraceCheckUtils]: 33: Hoare triple {1096#false} ~cond := #in~cond; {1096#false} is VALID [2018-11-23 13:02:42,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {1096#false} assume 0 == ~cond; {1096#false} is VALID [2018-11-23 13:02:42,670 INFO L273 TraceCheckUtils]: 35: Hoare triple {1096#false} assume !false; {1096#false} is VALID [2018-11-23 13:02:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:02:42,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:02:42,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 13:02:42,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:42,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:02:42,748 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 13:02:42,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:02:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:02:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:42,750 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-11-23 13:02:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,065 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-11-23 13:02:43,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:02:43,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 13:02:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:02:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 13:02:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:02:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 13:02:43,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 13:02:43,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:43,207 INFO L225 Difference]: With dead ends: 85 [2018-11-23 13:02:43,207 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:02:43,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:02:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 13:02:43,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:43,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2018-11-23 13:02:43,234 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2018-11-23 13:02:43,234 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2018-11-23 13:02:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,237 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 13:02:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 13:02:43,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,239 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2018-11-23 13:02:43,239 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2018-11-23 13:02:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,242 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 13:02:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 13:02:43,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:43,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:02:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 13:02:43,246 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2018-11-23 13:02:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:43,246 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 13:02:43,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:02:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 13:02:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:02:43,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:43,248 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 13:02:43,248 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:43,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 4 times [2018-11-23 13:02:43,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:43,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {1511#true} call ULTIMATE.init(); {1511#true} is VALID [2018-11-23 13:02:43,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {1511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1511#true} is VALID [2018-11-23 13:02:43,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {1511#true} assume true; {1511#true} is VALID [2018-11-23 13:02:43,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1511#true} {1511#true} #107#return; {1511#true} is VALID [2018-11-23 13:02:43,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {1511#true} call #t~ret15 := main(); {1511#true} is VALID [2018-11-23 13:02:43,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {1511#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1513#(= main_~i~0 0)} is VALID [2018-11-23 13:02:43,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {1513#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1513#(= main_~i~0 0)} is VALID [2018-11-23 13:02:43,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {1513#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1514#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {1514#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1514#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {1514#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1515#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {1515#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1515#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {1515#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1516#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:43,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {1516#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1516#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:43,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {1516#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1517#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:43,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {1517#(<= main_~i~0 4)} assume !(~i~0 < 5); {1512#false} is VALID [2018-11-23 13:02:43,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {1512#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1512#false} is VALID [2018-11-23 13:02:43,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {1512#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1512#false} is VALID [2018-11-23 13:02:43,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {1512#false} assume !(~i~0 < 5); {1512#false} is VALID [2018-11-23 13:02:43,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {1512#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1512#false} is VALID [2018-11-23 13:02:43,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {1512#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1512#false} is VALID [2018-11-23 13:02:43,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {1512#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1512#false} is VALID [2018-11-23 13:02:43,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {1512#false} assume !(0 != #t~mem7);havoc #t~mem7; {1512#false} is VALID [2018-11-23 13:02:43,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {1512#false} ~nc_B~0 := 0; {1512#false} is VALID [2018-11-23 13:02:43,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {1512#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1512#false} is VALID [2018-11-23 13:02:43,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {1512#false} assume !(0 != #t~mem9);havoc #t~mem9; {1512#false} is VALID [2018-11-23 13:02:43,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {1512#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1512#false} is VALID [2018-11-23 13:02:43,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {1512#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1512#false} is VALID [2018-11-23 13:02:43,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {1512#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1512#false} is VALID [2018-11-23 13:02:43,419 INFO L256 TraceCheckUtils]: 36: Hoare triple {1512#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1512#false} is VALID [2018-11-23 13:02:43,419 INFO L273 TraceCheckUtils]: 37: Hoare triple {1512#false} ~cond := #in~cond; {1512#false} is VALID [2018-11-23 13:02:43,420 INFO L273 TraceCheckUtils]: 38: Hoare triple {1512#false} assume 0 == ~cond; {1512#false} is VALID [2018-11-23 13:02:43,420 INFO L273 TraceCheckUtils]: 39: Hoare triple {1512#false} assume !false; {1512#false} is VALID [2018-11-23 13:02:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:02:43,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:43,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:43,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:02:43,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:02:43,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:43,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {1511#true} call ULTIMATE.init(); {1511#true} is VALID [2018-11-23 13:02:43,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {1511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1511#true} is VALID [2018-11-23 13:02:43,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {1511#true} assume true; {1511#true} is VALID [2018-11-23 13:02:43,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1511#true} {1511#true} #107#return; {1511#true} is VALID [2018-11-23 13:02:43,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {1511#true} call #t~ret15 := main(); {1511#true} is VALID [2018-11-23 13:02:43,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {1511#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1536#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:43,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {1536#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1536#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:43,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {1536#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1514#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {1514#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1514#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {1514#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1515#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {1515#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1515#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {1515#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1516#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:43,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1516#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1516#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:43,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {1516#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1517#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:43,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {1517#(<= main_~i~0 4)} assume !(~i~0 < 5); {1512#false} is VALID [2018-11-23 13:02:43,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {1512#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1512#false} is VALID [2018-11-23 13:02:43,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {1512#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1512#false} is VALID [2018-11-23 13:02:43,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,623 INFO L273 TraceCheckUtils]: 23: Hoare triple {1512#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1512#false} is VALID [2018-11-23 13:02:43,624 INFO L273 TraceCheckUtils]: 24: Hoare triple {1512#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1512#false} is VALID [2018-11-23 13:02:43,624 INFO L273 TraceCheckUtils]: 25: Hoare triple {1512#false} assume !(~i~0 < 5); {1512#false} is VALID [2018-11-23 13:02:43,624 INFO L273 TraceCheckUtils]: 26: Hoare triple {1512#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1512#false} is VALID [2018-11-23 13:02:43,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {1512#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1512#false} is VALID [2018-11-23 13:02:43,624 INFO L273 TraceCheckUtils]: 28: Hoare triple {1512#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1512#false} is VALID [2018-11-23 13:02:43,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {1512#false} assume !(0 != #t~mem7);havoc #t~mem7; {1512#false} is VALID [2018-11-23 13:02:43,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {1512#false} ~nc_B~0 := 0; {1512#false} is VALID [2018-11-23 13:02:43,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {1512#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1512#false} is VALID [2018-11-23 13:02:43,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {1512#false} assume !(0 != #t~mem9);havoc #t~mem9; {1512#false} is VALID [2018-11-23 13:02:43,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {1512#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1512#false} is VALID [2018-11-23 13:02:43,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {1512#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1512#false} is VALID [2018-11-23 13:02:43,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {1512#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1512#false} is VALID [2018-11-23 13:02:43,626 INFO L256 TraceCheckUtils]: 36: Hoare triple {1512#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1512#false} is VALID [2018-11-23 13:02:43,626 INFO L273 TraceCheckUtils]: 37: Hoare triple {1512#false} ~cond := #in~cond; {1512#false} is VALID [2018-11-23 13:02:43,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {1512#false} assume 0 == ~cond; {1512#false} is VALID [2018-11-23 13:02:43,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {1512#false} assume !false; {1512#false} is VALID [2018-11-23 13:02:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:02:43,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:43,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:02:43,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 13:02:43,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:43,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:02:43,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:43,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:02:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:02:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:02:43,781 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 13:02:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,551 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 13:02:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:02:44,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 13:02:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:02:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2018-11-23 13:02:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:02:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2018-11-23 13:02:44,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2018-11-23 13:02:44,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:44,852 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:02:44,852 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:02:44,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:02:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:02:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-23 13:02:44,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:44,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2018-11-23 13:02:44,881 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2018-11-23 13:02:44,881 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2018-11-23 13:02:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,885 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 13:02:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-11-23 13:02:44,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:44,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:44,886 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2018-11-23 13:02:44,886 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2018-11-23 13:02:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,889 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 13:02:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-11-23 13:02:44,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:44,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:44,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:44,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:02:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 13:02:44,892 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2018-11-23 13:02:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:44,893 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 13:02:44,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:02:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 13:02:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:02:44,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:44,894 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:44,894 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:44,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash 349736732, now seen corresponding path program 5 times [2018-11-23 13:02:44,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:44,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:44,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:45,050 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=9, |#NULL.offset|=6, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] RET #107#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret15 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(~i~0 < 5); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(~i~0 < 5); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(0 != #t~mem7);havoc #t~mem7; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] ~nc_B~0 := 0; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem9|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(0 != #t~mem9);havoc #t~mem9; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; VAL [main_~found~0=0, main_~i~0=0, main_~j~0=0, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); VAL [main_~found~0=0, main_~i~0=0, main_~j~0=0, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [main_~i~0=0, main_~j~0=0, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L21-L22] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] assume !!(0 == #t~mem3); [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L25-L26] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] assume !!(0 == #t~mem6); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] assume !(0 != #t~mem7); [L30] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] assume !(0 != #t~mem9); [L34] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] assume !!(~nc_B~0 >= ~nc_A~0); [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L21-L22] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] assume !!(0 == #t~mem3); [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L25-L26] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] assume !!(0 == #t~mem6); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] assume !(0 != #t~mem7); [L30] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] assume !(0 != #t~mem9); [L34] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] assume !!(~nc_B~0 >= ~nc_A~0); [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [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={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=1, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=2, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=3, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=4, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L21] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L23] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={7:0}, string_A[5 -1]=0, string_B={10:0}] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=1, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=2, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=3, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=4, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L25] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L27] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={7:0}, string_B={10: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={7:0}, string_B={10:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_A[nc_A]=0, string_B={10:0}] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={10:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={10: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=0, nc_B=0, string_A={7:0}, string_B={10:0}] [L41] COND FALSE !((inc_B-1)<= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={10:0}] [L41] COND FALSE !((inc_B-1)<