java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:25:10,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:25:10,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:25:10,867 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:25:10,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:25:10,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:25:10,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:25:10,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:25:10,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:25:10,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:25:10,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:25:10,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:25:10,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:25:10,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:25:10,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:25:10,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:25:10,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:25:10,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:25:10,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:25:10,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:25:10,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:25:10,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:25:10,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:25:10,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:25:10,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:25:10,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:25:10,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:25:10,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:25:10,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:25:10,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:25:10,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:25:10,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:25:10,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:25:10,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:25:10,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:25:10,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:25:10,921 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:25:10,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:25:10,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:25:10,946 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:25:10,946 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:25:10,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:25:10,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:25:10,948 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:25:10,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:25:10,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:25:10,949 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:25:10,949 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:25:10,949 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:25:10,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:25:10,950 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:25:10,950 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:25:10,950 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:25:10,950 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:25:10,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:25:10,951 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:25:10,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:25:10,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:25:10,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:25:10,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:25:10,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:25:10,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:10,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:25:10,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:25:10,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:25:10,953 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:25:10,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:25:10,953 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:25:10,955 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:25:10,955 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:25:11,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:25:11,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:25:11,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:25:11,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:25:11,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:25:11,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-23 11:25:11,111 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0617f52b7/5ebe67630865462495ded696b5569b2a/FLAGc954abbac [2018-11-23 11:25:11,571 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:25:11,571 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-23 11:25:11,577 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0617f52b7/5ebe67630865462495ded696b5569b2a/FLAGc954abbac [2018-11-23 11:25:11,913 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0617f52b7/5ebe67630865462495ded696b5569b2a [2018-11-23 11:25:11,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:25:11,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:25:11,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:11,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:25:11,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:25:11,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5eb1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11, skipping insertion in model container [2018-11-23 11:25:11,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:25:11,969 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:25:12,184 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:12,190 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:25:12,224 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:12,258 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:25:12,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12 WrapperNode [2018-11-23 11:25:12,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:12,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:12,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:25:12,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:25:12,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:12,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:25:12,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:25:12,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:25:12,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... [2018-11-23 11:25:12,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:25:12,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:25:12,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:25:12,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:25:12,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:12,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:25:12,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:25:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:25:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:25:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:25:12,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:25:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:25:12,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:25:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:25:12,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:25:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:25:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:25:13,134 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:25:13,135 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:25:13,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:13 BoogieIcfgContainer [2018-11-23 11:25:13,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:25:13,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:25:13,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:25:13,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:25:13,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:11" (1/3) ... [2018-11-23 11:25:13,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6e1eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:13, skipping insertion in model container [2018-11-23 11:25:13,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:12" (2/3) ... [2018-11-23 11:25:13,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6e1eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:13, skipping insertion in model container [2018-11-23 11:25:13,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:13" (3/3) ... [2018-11-23 11:25:13,145 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-11-23 11:25:13,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:25:13,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:25:13,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:25:13,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:25:13,218 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:25:13,218 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:25:13,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:25:13,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:25:13,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:25:13,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:25:13,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:25:13,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:25:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:25:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:25:13,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:13,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:13,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:13,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 11:25:13,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:13,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:13,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:13,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:13,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:25:13,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-23 11:25:13,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:25:13,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 11:25:13,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret9 := main(); {30#true} is VALID [2018-11-23 11:25:13,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {30#true} is VALID [2018-11-23 11:25:13,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:25:13,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {31#false} is VALID [2018-11-23 11:25:13,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !~bvsge32(~i~0, 0bv32); {31#false} is VALID [2018-11-23 11:25:13,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {31#false} is VALID [2018-11-23 11:25:13,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {31#false} is VALID [2018-11-23 11:25:13,477 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 11:25:13,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:25:13,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 11:25:13,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:25:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:13,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:25:13,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:25:13,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:13,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:25:13,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:13,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:25:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:25:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:13,689 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:25:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:13,947 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 11:25:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:25:13,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:25:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:25:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:25:13,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 11:25:14,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:14,247 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:25:14,248 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:25:14,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:25:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:25:14,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:14,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:14,295 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:14,295 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,299 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:25:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:25:14,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:14,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:14,300 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:14,301 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,305 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:25:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:25:14,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:14,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:14,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:14,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:25:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 11:25:14,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 11:25:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:14,311 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 11:25:14,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:25:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:25:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:25:14,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:14,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:14,313 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:14,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 11:25:14,314 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:14,314 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:14,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:14,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:14,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 11:25:14,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {210#true} is VALID [2018-11-23 11:25:14,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 11:25:14,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #63#return; {210#true} is VALID [2018-11-23 11:25:14,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret9 := main(); {210#true} is VALID [2018-11-23 11:25:14,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {230#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:14,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {230#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvult32(~i~0, ~max~0); {211#false} is VALID [2018-11-23 11:25:14,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {211#false} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {211#false} is VALID [2018-11-23 11:25:14,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {211#false} assume !~bvsge32(~i~0, 0bv32); {211#false} is VALID [2018-11-23 11:25:14,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {211#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {211#false} is VALID [2018-11-23 11:25:14,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {211#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {211#false} is VALID [2018-11-23 11:25:14,482 INFO L256 TraceCheckUtils]: 11: Hoare triple {211#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {211#false} is VALID [2018-11-23 11:25:14,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2018-11-23 11:25:14,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {211#false} assume 0bv32 == ~cond; {211#false} is VALID [2018-11-23 11:25:14,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 11:25:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:14,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:14,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:25:14,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:25:14,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:14,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:25:14,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:14,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:25:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:25:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:25:14,562 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 11:25:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,978 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 11:25:14,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:25:14,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:25:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:25:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:25:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:25:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:25:14,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 11:25:15,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:15,104 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:25:15,104 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:25:15,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:25:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:25:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:25:15,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:15,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:25:15,122 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:25:15,122 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:25:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:15,124 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:25:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:25:15,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:15,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:15,126 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:25:15,126 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:25:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:15,128 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:25:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:25:15,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:15,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:15,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:15,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:25:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:25:15,132 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 11:25:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:15,132 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:25:15,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:25:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:25:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:25:15,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:15,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:15,134 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:15,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1578997828, now seen corresponding path program 1 times [2018-11-23 11:25:15,135 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:15,135 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:15,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:15,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:15,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 11:25:15,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {390#true} is VALID [2018-11-23 11:25:15,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 11:25:15,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #63#return; {390#true} is VALID [2018-11-23 11:25:15,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret9 := main(); {390#true} is VALID [2018-11-23 11:25:15,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {410#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:15,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {410#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {410#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:15,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {417#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:15,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {417#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvult32(~i~0, ~max~0); {391#false} is VALID [2018-11-23 11:25:15,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#false} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {391#false} is VALID [2018-11-23 11:25:15,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#false} assume !~bvsge32(~i~0, 0bv32); {391#false} is VALID [2018-11-23 11:25:15,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {391#false} is VALID [2018-11-23 11:25:15,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {391#false} is VALID [2018-11-23 11:25:15,515 INFO L256 TraceCheckUtils]: 13: Hoare triple {391#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {391#false} is VALID [2018-11-23 11:25:15,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-23 11:25:15,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 0bv32 == ~cond; {391#false} is VALID [2018-11-23 11:25:15,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 11:25:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:15,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:15,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 11:25:15,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 0bv32 == ~cond; {391#false} is VALID [2018-11-23 11:25:15,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-23 11:25:15,645 INFO L256 TraceCheckUtils]: 13: Hoare triple {391#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {391#false} is VALID [2018-11-23 11:25:15,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {391#false} is VALID [2018-11-23 11:25:15,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {391#false} is VALID [2018-11-23 11:25:15,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#false} assume !~bvsge32(~i~0, 0bv32); {391#false} is VALID [2018-11-23 11:25:15,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#false} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {391#false} is VALID [2018-11-23 11:25:15,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(bvult main_~i~0 main_~max~0)} assume !~bvult32(~i~0, ~max~0); {391#false} is VALID [2018-11-23 11:25:15,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {473#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {469#(bvult main_~i~0 main_~max~0)} is VALID [2018-11-23 11:25:15,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {473#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-23 11:25:15,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {473#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-23 11:25:15,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret9 := main(); {390#true} is VALID [2018-11-23 11:25:15,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #63#return; {390#true} is VALID [2018-11-23 11:25:15,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 11:25:15,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {390#true} is VALID [2018-11-23 11:25:15,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 11:25:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:25:15,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:15,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:25:15,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:25:15,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:15,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:25:15,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:15,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:25:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:25:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:15,729 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 11:25:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,286 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 11:25:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:25:16,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:25:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 11:25:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 11:25:16,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 11:25:16,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:16,389 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:25:16,390 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:25:16,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:25:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:25:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 11:25:16,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:16,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 11:25:16,410 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:25:16,410 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:25:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,413 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:25:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:25:16,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:16,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:16,414 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:25:16,414 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:25:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,418 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:25:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:25:16,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:16,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:16,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:16,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:25:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 11:25:16,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-11-23 11:25:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:16,422 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 11:25:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:25:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:25:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:25:16,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:16,423 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:16,424 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:16,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1224789406, now seen corresponding path program 2 times [2018-11-23 11:25:16,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:16,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:16,442 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:25:16,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:25:16,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:16,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:16,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 11:25:16,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {659#true} is VALID [2018-11-23 11:25:16,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 11:25:16,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #63#return; {659#true} is VALID [2018-11-23 11:25:16,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2018-11-23 11:25:16,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {659#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvult32(~i~0, ~max~0); {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,649 INFO L273 TraceCheckUtils]: 15: Hoare triple {679#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {710#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {660#false} is VALID [2018-11-23 11:25:16,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {660#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {660#false} is VALID [2018-11-23 11:25:16,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {660#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {660#false} is VALID [2018-11-23 11:25:16,651 INFO L256 TraceCheckUtils]: 19: Hoare triple {660#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {660#false} is VALID [2018-11-23 11:25:16,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2018-11-23 11:25:16,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {660#false} assume 0bv32 == ~cond; {660#false} is VALID [2018-11-23 11:25:16,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 11:25:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:25:16,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:16,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:16,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:25:16,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 11:25:16,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:16,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:25:16,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:16,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:25:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:25:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:25:16,710 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2018-11-23 11:25:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,883 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 11:25:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:25:16,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 11:25:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:25:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 11:25:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:25:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 11:25:16,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 11:25:16,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:16,960 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:25:16,960 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:25:16,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:25:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:25:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 11:25:17,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:17,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 11:25:17,043 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 11:25:17,043 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 11:25:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:17,045 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:25:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 11:25:17,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:17,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:17,046 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 11:25:17,046 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 11:25:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:17,051 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:25:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 11:25:17,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:17,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:17,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:17,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:25:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 11:25:17,054 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-23 11:25:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:17,055 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 11:25:17,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:25:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 11:25:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:25:17,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:17,058 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:17,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:17,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash 231531900, now seen corresponding path program 1 times [2018-11-23 11:25:17,059 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:17,060 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:17,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:25:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:17,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:17,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-23 11:25:17,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {898#true} is VALID [2018-11-23 11:25:17,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:25:17,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {898#true} {898#true} #63#return; {898#true} is VALID [2018-11-23 11:25:17,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {898#true} call #t~ret9 := main(); {898#true} is VALID [2018-11-23 11:25:17,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {918#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:17,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {918#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {918#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:17,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {918#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {925#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:17,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {925#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {925#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:17,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {925#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {932#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:25:17,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {932#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {932#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:25:17,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {932#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {939#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:17,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {939#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {939#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:17,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {946#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-23 11:25:17,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {946#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume !~bvult32(~i~0, ~max~0); {899#false} is VALID [2018-11-23 11:25:17,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#false} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {899#false} is VALID [2018-11-23 11:25:17,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {899#false} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {899#false} is VALID [2018-11-23 11:25:17,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {899#false} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {899#false} is VALID [2018-11-23 11:25:17,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {899#false} assume !~bvsge32(~i~0, 0bv32); {899#false} is VALID [2018-11-23 11:25:17,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {899#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {899#false} is VALID [2018-11-23 11:25:17,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {899#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {899#false} is VALID [2018-11-23 11:25:17,319 INFO L256 TraceCheckUtils]: 21: Hoare triple {899#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {899#false} is VALID [2018-11-23 11:25:17,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {899#false} ~cond := #in~cond; {899#false} is VALID [2018-11-23 11:25:17,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {899#false} assume 0bv32 == ~cond; {899#false} is VALID [2018-11-23 11:25:17,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-23 11:25:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:17,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:17,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-23 11:25:17,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {899#false} assume 0bv32 == ~cond; {899#false} is VALID [2018-11-23 11:25:17,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {899#false} ~cond := #in~cond; {899#false} is VALID [2018-11-23 11:25:17,591 INFO L256 TraceCheckUtils]: 21: Hoare triple {899#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {899#false} is VALID [2018-11-23 11:25:17,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {899#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {899#false} is VALID [2018-11-23 11:25:17,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {899#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {899#false} is VALID [2018-11-23 11:25:17,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {899#false} assume !~bvsge32(~i~0, 0bv32); {899#false} is VALID [2018-11-23 11:25:17,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {899#false} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {899#false} is VALID [2018-11-23 11:25:17,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {899#false} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {899#false} is VALID [2018-11-23 11:25:17,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#false} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {899#false} is VALID [2018-11-23 11:25:17,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {1010#(bvult main_~i~0 main_~max~0)} assume !~bvult32(~i~0, ~max~0); {899#false} is VALID [2018-11-23 11:25:17,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {1014#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1010#(bvult main_~i~0 main_~max~0)} is VALID [2018-11-23 11:25:17,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {1014#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1014#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {1021#(bvult (bvadd main_~i~0 (_ bv2 32)) main_~max~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1014#(bvult (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {1021#(bvult (bvadd main_~i~0 (_ bv2 32)) main_~max~0)} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1021#(bvult (bvadd main_~i~0 (_ bv2 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {1028#(bvult (bvadd main_~i~0 (_ bv3 32)) main_~max~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1021#(bvult (bvadd main_~i~0 (_ bv2 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#(bvult (bvadd main_~i~0 (_ bv3 32)) main_~max~0)} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1028#(bvult (bvadd main_~i~0 (_ bv3 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {1035#(bvult (bvadd main_~i~0 (_ bv4 32)) main_~max~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1028#(bvult (bvadd main_~i~0 (_ bv3 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {1035#(bvult (bvadd main_~i~0 (_ bv4 32)) main_~max~0)} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1035#(bvult (bvadd main_~i~0 (_ bv4 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {1035#(bvult (bvadd main_~i~0 (_ bv4 32)) main_~max~0)} is VALID [2018-11-23 11:25:17,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {898#true} call #t~ret9 := main(); {898#true} is VALID [2018-11-23 11:25:17,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {898#true} {898#true} #63#return; {898#true} is VALID [2018-11-23 11:25:17,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:25:17,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {898#true} is VALID [2018-11-23 11:25:17,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-23 11:25:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:17,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:17,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:25:17,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 11:25:17,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:17,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:25:17,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:17,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:25:17,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:25:17,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:17,837 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2018-11-23 11:25:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:18,637 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 11:25:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:25:18,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 11:25:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 11:25:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 11:25:18,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2018-11-23 11:25:18,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:18,756 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:25:18,757 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:25:18,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:25:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 11:25:18,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:18,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 11:25:18,800 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 11:25:18,800 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 11:25:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:18,802 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 11:25:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 11:25:18,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:18,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:18,803 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 11:25:18,803 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 11:25:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:18,805 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 11:25:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 11:25:18,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:18,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:18,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:18,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:25:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 11:25:18,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2018-11-23 11:25:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:18,809 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 11:25:18,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:25:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:25:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:25:18,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:18,810 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:18,810 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:18,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1257742822, now seen corresponding path program 2 times [2018-11-23 11:25:18,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:18,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:18,843 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:25:18,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:25:18,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:18,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:18,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-23 11:25:18,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1240#true} is VALID [2018-11-23 11:25:18,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-23 11:25:18,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1240#true} {1240#true} #63#return; {1240#true} is VALID [2018-11-23 11:25:18,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {1240#true} call #t~ret9 := main(); {1240#true} is VALID [2018-11-23 11:25:18,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {1240#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:18,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:18,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:18,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvult32(~i~0, ~max~0); {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {1260#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {1297#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {1297#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1297#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {1297#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1304#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1241#false} is VALID [2018-11-23 11:25:19,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {1241#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {1241#false} is VALID [2018-11-23 11:25:19,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {1241#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1241#false} is VALID [2018-11-23 11:25:19,010 INFO L256 TraceCheckUtils]: 23: Hoare triple {1241#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {1241#false} is VALID [2018-11-23 11:25:19,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-23 11:25:19,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {1241#false} assume 0bv32 == ~cond; {1241#false} is VALID [2018-11-23 11:25:19,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-23 11:25:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:25:19,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:19,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-23 11:25:19,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {1241#false} assume 0bv32 == ~cond; {1241#false} is VALID [2018-11-23 11:25:19,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-23 11:25:19,174 INFO L256 TraceCheckUtils]: 23: Hoare triple {1241#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {1241#false} is VALID [2018-11-23 11:25:19,175 INFO L273 TraceCheckUtils]: 22: Hoare triple {1241#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1241#false} is VALID [2018-11-23 11:25:19,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {1241#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {1241#false} is VALID [2018-11-23 11:25:19,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {1344#(bvsge main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1241#false} is VALID [2018-11-23 11:25:19,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {1348#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1344#(bvsge main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:19,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1348#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {1348#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~i~0, ~max~0); {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {1240#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {1355#(bvsge (bvadd main_~max~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:19,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {1240#true} call #t~ret9 := main(); {1240#true} is VALID [2018-11-23 11:25:19,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1240#true} {1240#true} #63#return; {1240#true} is VALID [2018-11-23 11:25:19,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-23 11:25:19,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1240#true} is VALID [2018-11-23 11:25:19,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-23 11:25:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:25:19,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:19,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:25:19,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:25:19,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:19,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:25:19,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:19,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:25:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:25:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:25:19,240 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-11-23 11:25:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:19,805 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 11:25:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:25:19,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:25:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:25:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-23 11:25:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:25:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-23 11:25:19,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2018-11-23 11:25:19,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:19,919 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:25:19,919 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:25:19,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:25:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:25:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 11:25:20,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:20,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-23 11:25:20,068 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-23 11:25:20,068 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-23 11:25:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:20,072 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 11:25:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 11:25:20,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:20,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:20,073 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-23 11:25:20,073 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-23 11:25:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:20,075 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 11:25:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 11:25:20,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:20,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:20,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:20,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:25:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 11:25:20,079 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-11-23 11:25:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:20,079 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 11:25:20,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:25:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 11:25:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:25:20,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:20,081 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:20,081 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:20,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash -894191052, now seen corresponding path program 3 times [2018-11-23 11:25:20,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:20,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:20,101 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:25:20,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:25:20,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:20,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:20,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {1635#true} call ULTIMATE.init(); {1635#true} is VALID [2018-11-23 11:25:20,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {1635#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1635#true} is VALID [2018-11-23 11:25:20,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {1635#true} assume true; {1635#true} is VALID [2018-11-23 11:25:20,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1635#true} {1635#true} #63#return; {1635#true} is VALID [2018-11-23 11:25:20,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {1635#true} call #t~ret9 := main(); {1635#true} is VALID [2018-11-23 11:25:20,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {1635#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvult32(~i~0, ~max~0); {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {1655#(= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32))} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {1692#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {1692#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1692#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {1692#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1699#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1699#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:20,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {1699#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1706#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:25:20,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {1706#(= (_ bv2 32) main_~i~0)} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1706#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:25:20,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {1706#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1713#(= (_ bv1 32) main_~i~0)} is VALID [2018-11-23 11:25:20,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {1713#(= (_ bv1 32) main_~i~0)} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1713#(= (_ bv1 32) main_~i~0)} is VALID [2018-11-23 11:25:20,658 INFO L273 TraceCheckUtils]: 25: Hoare triple {1713#(= (_ bv1 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1720#(= (_ bv0 32) main_~i~0)} is VALID [2018-11-23 11:25:20,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {1720#(= (_ bv0 32) main_~i~0)} assume !~bvsge32(~i~0, 0bv32); {1636#false} is VALID [2018-11-23 11:25:20,659 INFO L273 TraceCheckUtils]: 27: Hoare triple {1636#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {1636#false} is VALID [2018-11-23 11:25:20,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {1636#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1636#false} is VALID [2018-11-23 11:25:20,659 INFO L256 TraceCheckUtils]: 29: Hoare triple {1636#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {1636#false} is VALID [2018-11-23 11:25:20,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {1636#false} ~cond := #in~cond; {1636#false} is VALID [2018-11-23 11:25:20,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {1636#false} assume 0bv32 == ~cond; {1636#false} is VALID [2018-11-23 11:25:20,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {1636#false} assume !false; {1636#false} is VALID [2018-11-23 11:25:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:25:20,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:21,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {1636#false} assume !false; {1636#false} is VALID [2018-11-23 11:25:21,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {1636#false} assume 0bv32 == ~cond; {1636#false} is VALID [2018-11-23 11:25:21,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {1636#false} ~cond := #in~cond; {1636#false} is VALID [2018-11-23 11:25:21,216 INFO L256 TraceCheckUtils]: 29: Hoare triple {1636#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {1636#false} is VALID [2018-11-23 11:25:21,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {1636#false} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1636#false} is VALID [2018-11-23 11:25:21,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {1636#false} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {1636#false} is VALID [2018-11-23 11:25:21,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {1760#(bvsge main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1636#false} is VALID [2018-11-23 11:25:21,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {1764#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1760#(bvsge main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:21,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {1768#(or (not (bvsge main_~i~0 (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1764#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:21,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {1772#(or (not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1768#(or (not (bvsge main_~i~0 (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {1772#(or (not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1772#(or (not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {1779#(or (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1772#(or (not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {1779#(or (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1779#(or (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 11:25:21,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {1786#(or (bvsge (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1779#(or (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 11:25:21,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {1786#(or (bvsge (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1786#(or (bvsge (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:25:21,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {1786#(or (bvsge (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:25:21,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !~bvult32(~i~0, ~max~0); {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {1635#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {1793#(or (not (bvsge (bvadd main_~max~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsge (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:21,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {1635#true} call #t~ret9 := main(); {1635#true} is VALID [2018-11-23 11:25:21,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1635#true} {1635#true} #63#return; {1635#true} is VALID [2018-11-23 11:25:21,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {1635#true} assume true; {1635#true} is VALID [2018-11-23 11:25:21,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {1635#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1635#true} is VALID [2018-11-23 11:25:21,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {1635#true} call ULTIMATE.init(); {1635#true} is VALID [2018-11-23 11:25:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:25:21,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-11-23 11:25:21,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-23 11:25:21,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:21,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:25:21,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:21,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:25:21,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:25:21,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:25:21,436 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2018-11-23 11:25:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:24,133 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-11-23 11:25:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:25:24,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-23 11:25:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:25:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2018-11-23 11:25:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:25:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2018-11-23 11:25:24,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 90 transitions. [2018-11-23 11:25:24,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:24,310 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:25:24,310 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:25:24,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:25:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:25:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-11-23 11:25:24,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:24,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 50 states. [2018-11-23 11:25:24,360 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 50 states. [2018-11-23 11:25:24,361 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 50 states. [2018-11-23 11:25:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:24,364 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-23 11:25:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-11-23 11:25:24,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:24,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:24,365 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 67 states. [2018-11-23 11:25:24,366 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 67 states. [2018-11-23 11:25:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:24,369 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-23 11:25:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-11-23 11:25:24,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:24,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:24,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:24,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:25:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-23 11:25:24,372 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 33 [2018-11-23 11:25:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:24,372 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-23 11:25:24,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:25:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-23 11:25:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:25:24,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:24,373 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:24,373 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:24,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash -294189934, now seen corresponding path program 4 times [2018-11-23 11:25:24,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:24,374 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:24,395 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:25:24,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:25:24,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:24,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:24,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:25:24,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:24,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:24,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-11-23 11:25:24,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 11:25:24,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 11:25:24,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:24,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:24,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:24,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-11-23 11:25:24,882 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:24,882 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, |v_main_#t~nondet1_18|]. (and (= |#memory_int| (store |v_#memory_int_35| |main_~#str1~0.base| (store (select |v_#memory_int_35| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet1_18|)))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) [2018-11-23 11:25:24,883 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_18|]. (and (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) [2018-11-23 11:25:25,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 11:25:25,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:25,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-11-23 11:25:25,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:25,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:25,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:25,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2018-11-23 11:25:25,154 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:25,154 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_18|]. (let ((.cse0 (select |v_#memory_int_36| |main_~#str1~0.base|))) (and (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|)) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (store |v_#memory_int_36| |main_~#str1~0.base| (store .cse0 (bvadd |main_~#str1~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet1_19|))) |#memory_int|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:25:25,155 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_19|, |v_main_#t~nondet1_18|]. (let ((.cse0 (select |#memory_int| |main_~#str1~0.base|))) (and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:25:25,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-23 11:25:25,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:25,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:25,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:25,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 61 [2018-11-23 11:25:25,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:25,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:25,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:25,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:51 [2018-11-23 11:25:25,709 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:25,709 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_18|, |v_main_#t~nondet1_19|]. (let ((.cse0 (select |v_#memory_int_37| |main_~#str1~0.base|))) (and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= |#memory_int| (store |v_#memory_int_37| |main_~#str1~0.base| (store .cse0 (bvadd |main_~#str1~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet1_20|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|)) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_19|)) (= (_ bv2 32) main_~i~0))) [2018-11-23 11:25:25,709 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_18|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_20|]. (let ((.cse0 (select |#memory_int| |main_~#str1~0.base|))) (and (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|)) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32)))) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0)) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (_ bv2 32) main_~i~0))) [2018-11-23 11:25:26,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 11:25:26,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:26,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:26,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:26,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:26,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:26,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:26,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 101 [2018-11-23 11:25:26,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:26,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:26,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:26,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:64 [2018-11-23 11:25:27,325 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:27,325 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, |v_main_#t~nondet1_21|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_18|]. (let ((.cse0 (select |v_#memory_int_38| |main_~#str1~0.base|))) (and (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32)))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (store |v_#memory_int_38| |main_~#str1~0.base| (store .cse0 (bvadd |main_~#str1~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet1_21|))) |#memory_int|) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|)))) [2018-11-23 11:25:27,325 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_18|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_21|]. (let ((.cse0 (select |#memory_int| |main_~#str1~0.base|))) (and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32)))) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select .cse0 (bvadd |main_~#str1~0.offset| main_~i~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) [2018-11-23 11:25:27,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-11-23 11:25:27,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:27,856 INFO L303 Elim1Store]: Index analysis took 178 ms [2018-11-23 11:25:27,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 121 [2018-11-23 11:25:27,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:27,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:27,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:27,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:64 [2018-11-23 11:25:29,978 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:29,979 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, |v_main_#t~nondet1_22|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_18|, |v_main_#t~nondet1_21|]. (let ((.cse0 (select |v_#memory_int_39| |main_~#str1~0.base|))) (and (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv1 32)))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select .cse0 |main_~#str1~0.offset|)) (= (store |v_#memory_int_39| |main_~#str1~0.base| (store .cse0 (bvadd |main_~#str1~0.offset| (_ bv4 32)) ((_ sign_extend 24) |v_main_#t~nondet1_22|))) |#memory_int|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv3 32)))))) [2018-11-23 11:25:29,979 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_22|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_18|, |v_main_#t~nondet1_21|, |v_main_#t~nondet1_19|]. (let ((.cse0 (select |#memory_int| |main_~#str1~0.base|))) (and (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv4 32)))) (= (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select .cse0 |main_~#str1~0.offset|)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv3 32)))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv1 32)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) [2018-11-23 11:25:30,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-11-23 11:25:30,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,318 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:30,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:30,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 130 [2018-11-23 11:25:30,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:30,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:30,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:30,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:73 [2018-11-23 11:25:31,194 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:31,194 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_22|, |v_main_#t~nondet1_18|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_21|]. (let ((.cse0 (select |v_#memory_int_40| |main_~#str1~0.base|))) (and (= main_~j~0 (_ bv0 32)) (= (store |v_#memory_int_40| |main_~#str1~0.base| (store .cse0 (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)) ((_ sign_extend 24) (_ bv0 8)))) |#memory_int|) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv4 32))) ((_ sign_extend 24) |v_main_#t~nondet1_22|)) (= (select .cse0 |main_~#str1~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet1_18|)) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv1 32)))) (= main_~i~0 (bvadd main_~max~0 (_ bv4294967295 32))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv3 32)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) [2018-11-23 11:25:31,195 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_20|, |v_main_#t~nondet1_18|, |v_main_#t~nondet1_21|, |v_main_#t~nondet1_19|]. (let ((.cse0 (select |#memory_int| |main_~#str1~0.base|))) (and (= main_~j~0 (_ bv0 32)) (= (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select .cse0 (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select .cse0 |main_~#str1~0.offset|)) (= main_~i~0 (bvadd main_~max~0 (_ bv4294967295 32))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv3 32)))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select .cse0 (bvadd |main_~#str1~0.offset| (_ bv1 32)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) [2018-11-23 11:25:31,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-11-23 11:25:31,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 11:25:31,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:31,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:31,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:31,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:90 [2018-11-23 11:25:31,828 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 11:25:32,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 87 [2018-11-23 11:25:32,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:32,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-11-23 11:25:32,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:32,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:32,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:32,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:109 [2018-11-23 11:25:32,629 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:25:32,902 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:25:33,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 104 [2018-11-23 11:25:33,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:33,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:33,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:33,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 78 [2018-11-23 11:25:33,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:33,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:33,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:33,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:132, output treesize:128 [2018-11-23 11:25:33,896 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-23 11:25:34,197 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-23 11:25:34,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 121 [2018-11-23 11:25:34,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:34,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:34,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:34,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:34,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:34,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:34,519 INFO L303 Elim1Store]: Index analysis took 168 ms [2018-11-23 11:25:34,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 124 [2018-11-23 11:25:34,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:34,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:34,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:34,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:151, output treesize:147 [2018-11-23 11:25:35,189 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-23 11:25:35,642 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-23 11:25:35,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 135 [2018-11-23 11:25:35,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:35,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 161 [2018-11-23 11:25:35,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:36,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:36,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:36,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:157, output treesize:153 [2018-11-23 11:25:37,240 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-23 11:25:37,754 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-23 11:25:37,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 92 [2018-11-23 11:25:37,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 8 [2018-11-23 11:25:37,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:37,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2018-11-23 11:25:37,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:37,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:37,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:37,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:126, output treesize:13 [2018-11-23 11:25:38,028 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:38,029 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, |main_~#str1~0.base|, |v_main_#t~nondet1_19|, |v_main_#t~nondet1_18|, |v_main_#t~nondet1_20|, |v_main_#t~nondet1_21|]. (let ((.cse8 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse3 (select .cse8 (_ bv0 32))) (.cse0 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse5 (select .cse8 (_ bv4 32))) (.cse6 (select .cse0 (_ bv4 32))) (.cse7 ((_ extract 7 0) .cse3)) (.cse2 (select .cse8 (_ bv1 32))) (.cse1 (select .cse8 (_ bv3 32))) (.cse4 (select .cse8 (_ bv2 32)))) (and (= (select .cse0 (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) .cse1))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) .cse2) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) .cse3) (= .cse4 ((_ sign_extend 24) |v_main_#t~nondet1_20|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) (_ bv0 8)) .cse5) (= (select .cse0 (_ bv0 32)) ((_ sign_extend 24) ((_ extract 7 0) .cse5))) (= |main_#t~mem7| ((_ extract 7 0) .cse6)) (= .cse6 ((_ sign_extend 24) .cse7)) (= .cse7 |main_#t~mem6|) (= ((_ sign_extend 24) ((_ extract 7 0) .cse2)) (select .cse0 (_ bv3 32))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) .cse1) (= (select .cse0 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) .cse4))))))) [2018-11-23 11:25:38,029 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet1_18|]. (let ((.cse0 ((_ extract 7 0) ((_ sign_extend 24) |v_main_#t~nondet1_18|)))) (and (= |main_#t~mem6| .cse0) (= ((_ extract 7 0) ((_ sign_extend 24) .cse0)) |main_#t~mem7|))) [2018-11-23 11:25:38,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2018-11-23 11:25:38,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {2191#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2191#true} is VALID [2018-11-23 11:25:38,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {2191#true} assume true; {2191#true} is VALID [2018-11-23 11:25:38,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2191#true} {2191#true} #63#return; {2191#true} is VALID [2018-11-23 11:25:38,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {2191#true} call #t~ret9 := main(); {2191#true} is VALID [2018-11-23 11:25:38,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {2191#true} ~max~0 := 5bv32;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~max~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~max~0);havoc ~i~0;havoc ~j~0;~i~0 := 0bv32; {2211#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {2211#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {2215#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {2215#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2219#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:38,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {2219#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {2223#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:38,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {2223#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2227#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= (_ bv2 32) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {2227#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= (_ bv2 32) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {2231#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (_ bv0 32) |main_~#str1~0.offset|) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= (_ bv2 32) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {2231#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (_ bv0 32) |main_~#str1~0.offset|) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= (_ bv2 32) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2235#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} is VALID [2018-11-23 11:25:38,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {2235#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {2239#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))))) (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} is VALID [2018-11-23 11:25:38,344 INFO L273 TraceCheckUtils]: 13: Hoare triple {2239#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))))) (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2243#(and (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv4 32) main_~i~0) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967292 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {2243#(and (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967293 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967295 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv4 32) main_~i~0) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967292 32))) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv4294967294 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvult32(~i~0, ~max~0);call write~intINTTYPE1(#t~nondet1, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet1; {2247#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {2247#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2247#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {2247#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !~bvult32(~i~0, ~max~0); {2247#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {2247#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_22|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~max~0, 1bv32)), 1bv32);~j~0 := 0bv32;~i~0 := ~bvsub32(~max~0, 1bv32); {2257#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= main_~j~0 (_ bv0 32)) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (bvadd main_~i~0 (_ bv1 32)) main_~max~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {2257#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= main_~j~0 (_ bv0 32)) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (bvadd main_~i~0 (_ bv1 32)) main_~max~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2261#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~max~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {2261#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~max~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {2265#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (bvadd main_~max~0 (_ bv4294967294 32)) main_~i~0) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:25:38,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {2265#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (bvadd main_~max~0 (_ bv4294967294 32)) main_~i~0) (= (_ bv0 32) |main_~#str2~0.offset|) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2269#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (bvadd main_~max~0 (_ bv4294967294 32)) main_~i~0) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} is VALID [2018-11-23 11:25:38,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {2269#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (bvadd main_~max~0 (_ bv4294967294 32)) main_~i~0) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {2273#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (bvadd main_~i~0 (_ bv3 32)) main_~max~0) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))))} is VALID [2018-11-23 11:25:38,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {2273#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (bvadd main_~i~0 (_ bv3 32)) main_~max~0) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2277#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (bvadd main_~i~0 (_ bv3 32)) main_~max~0) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} is VALID [2018-11-23 11:25:38,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2277#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (bvadd main_~i~0 (_ bv3 32)) main_~max~0) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {2281#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32)))))) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv3 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (= (bvadd main_~max~0 (_ bv4294967292 32)) main_~i~0) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))))} is VALID [2018-11-23 11:25:38,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {2281#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32)))))) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv3 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (= (bvadd main_~max~0 (_ bv4294967292 32)) main_~i~0) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2285#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv3 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (= (bvadd main_~max~0 (_ bv4294967292 32)) main_~i~0) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967293 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32)))))) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} is VALID [2018-11-23 11:25:38,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {2285#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv3 32))))) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv1 32)))))) (= (bvadd main_~max~0 (_ bv4294967292 32)) main_~i~0) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967293 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0 (_ bv2 32)))))) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {2289#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32)))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967293 32)))) (= (bvadd main_~i~0 (_ bv5 32)) main_~max~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))))} is VALID [2018-11-23 11:25:38,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {2289#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967294 32)))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967293 32)))) (= (bvadd main_~i~0 (_ bv5 32)) main_~max~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0 (_ bv4294967295 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem3 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(#t~mem3, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2293#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967291 32)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))))} is VALID [2018-11-23 11:25:38,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {2293#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967291 32)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))))} #t~post2 := ~i~0;~i~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {2293#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967291 32)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))))} is VALID [2018-11-23 11:25:38,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {2293#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967291 32)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))))} assume !~bvsge32(~i~0, 0bv32); {2293#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967291 32)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))))} is VALID [2018-11-23 11:25:38,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {2293#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967291 32)))))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967292 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967294 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32)))) (= (_ bv0 32) |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967295 32))) ((_ sign_extend 24) (_ bv0 8))) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~max~0 (_ bv4294967293 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))))} ~j~0 := ~bvsub32(~max~0, 1bv32);~i~0 := 0bv32; {2303#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32)))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32)))))) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))) ((_ sign_extend 24) (_ bv0 8))))} is VALID [2018-11-23 11:25:38,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {2303#(and (exists ((|v_main_#t~nondet1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_21|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv4 32)))) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv1 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv3 32)))))) (exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_18|) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))) (= (_ bv0 32) |main_~#str2~0.offset|) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv3 32))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32)))))) (= (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32)))))) (exists ((|v_main_#t~nondet1_19| (_ BitVec 8))) (= ((_ sign_extend 24) |v_main_#t~nondet1_19|) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv1 32))))) (= (_ bv0 32) |main_~#str1~0.offset|) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))))) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| (_ bv2 32)))) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet1_20| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv2 32))) ((_ sign_extend 24) |v_main_#t~nondet1_20|))) (= (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| (_ bv4 32))) ((_ sign_extend 24) (_ bv0 8))))} assume !!~bvult32(~i~0, ~max~0);call #t~mem6 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem7 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {2307#(exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (and (= |main_#t~mem6| ((_ extract 7 0) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) |v_main_#t~nondet1_18|)))) |main_#t~mem7|)))} is VALID [2018-11-23 11:25:38,985 INFO L256 TraceCheckUtils]: 31: Hoare triple {2307#(exists ((|v_main_#t~nondet1_18| (_ BitVec 8))) (and (= |main_#t~mem6| ((_ extract 7 0) ((_ sign_extend 24) |v_main_#t~nondet1_18|))) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) |v_main_#t~nondet1_18|)))) |main_#t~mem7|)))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem6) == ~sign_extendFrom8To32(#t~mem7) then 1bv32 else 0bv32)); {2311#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:38,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {2311#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2315#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:38,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {2315#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2192#false} is VALID [2018-11-23 11:25:38,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2018-11-23 11:25:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:39,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:51,642 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:25:57,425 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:26:12,621 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 11:26:36,920 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 11:26:54,218 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-23 11:27:17,990 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-23 11:27:48,037 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-23 11:28:16,987 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 81