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_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:22:20,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:22:20,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:22:20,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:22:20,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:22:20,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:22:20,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:22:20,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:22:20,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:22:20,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:22:20,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:22:20,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:22:20,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:22:20,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:22:20,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:22:20,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:22:20,772 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:22:20,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:22:20,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:22:20,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:22:20,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:22:20,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:22:20,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:22:20,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:22:20,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:22:20,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:22:20,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:22:20,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:22:20,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:22:20,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:22:20,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:22:20,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:22:20,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:22:20,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:22:20,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:22:20,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:22:20,805 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:22:20,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:22:20,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:22:20,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:22:20,832 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:22:20,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:22:20,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:22:20,833 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:22:20,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:22:20,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:22:20,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:22:20,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:22:20,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:22:20,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:22:20,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:22:20,835 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:22:20,835 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:22:20,836 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:22:20,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:22:20,837 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:22:20,837 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:22:20,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:22:20,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:22:20,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:22:20,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:22:20,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:22:20,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:22:20,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:22:20,839 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:22:20,840 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:22:20,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:22:20,840 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:22:20,840 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:22:20,840 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:22:20,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:22:20,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:22:20,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:22:20,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:22:20,904 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:22:20,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 11:22:20,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740812bc4/fd72decc8af8477faa2374204d3d3605/FLAGa2c24eaf3 [2018-11-23 11:22:21,493 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:22:21,493 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 11:22:21,500 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740812bc4/fd72decc8af8477faa2374204d3d3605/FLAGa2c24eaf3 [2018-11-23 11:22:21,825 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740812bc4/fd72decc8af8477faa2374204d3d3605 [2018-11-23 11:22:21,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:22:21,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:22:21,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:22:21,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:22:21,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:22:21,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:22:21" (1/1) ... [2018-11-23 11:22:21,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f51387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:21, skipping insertion in model container [2018-11-23 11:22:21,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:22:21" (1/1) ... [2018-11-23 11:22:21,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:22:21,882 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:22:22,102 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:22:22,115 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:22:22,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:22:22,166 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:22:22,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22 WrapperNode [2018-11-23 11:22:22,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:22:22,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:22:22,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:22:22,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:22:22,178 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:22:22" (1/1) ... [2018-11-23 11:22:22,188 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:22:22" (1/1) ... [2018-11-23 11:22:22,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:22:22,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:22:22,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:22:22,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:22:22,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (1/1) ... [2018-11-23 11:22:22,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:22:22,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:22:22,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:22:22,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:22:22,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (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:22:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:22:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:22:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:22:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:22:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:22:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:22:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:22:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:22:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:22:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:22:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:22:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:22:23,014 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:22:23,014 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:22:23,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:22:23 BoogieIcfgContainer [2018-11-23 11:22:23,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:22:23,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:22:23,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:22:23,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:22:23,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:22:21" (1/3) ... [2018-11-23 11:22:23,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fca5097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:22:23, skipping insertion in model container [2018-11-23 11:22:23,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:22" (2/3) ... [2018-11-23 11:22:23,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fca5097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:22:23, skipping insertion in model container [2018-11-23 11:22:23,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:22:23" (3/3) ... [2018-11-23 11:22:23,023 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-23 11:22:23,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:22:23,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:22:23,059 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:22:23,092 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:22:23,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:22:23,093 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:22:23,093 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:22:23,093 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:22:23,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:22:23,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:22:23,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:22:23,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:22:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:22:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:22:23,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:23,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:23,122 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:23,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 11:22:23,131 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:23,131 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:22:23,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:23,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:23,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:22:23,337 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:22:23,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:22:23,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 11:22:23,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret10 := main(); {30#true} is VALID [2018-11-23 11:22:23,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {30#true} is VALID [2018-11-23 11:22:23,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:22:23,341 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:22:23,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !~bvsge32(~i~0, 0bv32); {31#false} is VALID [2018-11-23 11:22:23,342 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:22:23,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {31#false} is VALID [2018-11-23 11:22:23,343 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 11:22:23,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:22:23,344 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 11:22:23,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:22:23,348 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:22:23,348 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:22:23,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:22:23,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:22:23,361 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:22:23,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:23,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:22:23,570 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:22:23,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:22:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:22:23,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:22:23,585 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:22:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:23,799 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 11:22:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:22:23,799 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:22:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:22:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:22:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:22:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:22:23,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 11:22:24,051 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:22:24,063 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:22:24,063 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:22:24,067 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:22:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:22:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:22:24,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:24,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:22:24,115 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:22:24,115 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:22:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:24,119 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:22:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:22:24,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:24,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:24,121 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:22:24,121 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:22:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:24,125 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:22:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:22:24,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:24,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:24,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:24,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:22:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 11:22:24,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 11:22:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:24,131 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 11:22:24,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:22:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:22:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:22:24,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:24,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:24,133 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:24,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 11:22:24,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:24,135 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:22:24,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:24,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:24,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 11:22:24,493 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:22:24,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 11:22:24,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #63#return; {210#true} is VALID [2018-11-23 11:22:24,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret10 := main(); {210#true} is VALID [2018-11-23 11:22:24,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {210#true} is VALID [2018-11-23 11:22:24,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {210#true} assume !~bvslt32(~i~0, ~MAX~0); {210#true} is VALID [2018-11-23 11:22:24,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {210#true} 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); {236#(= (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)} is VALID [2018-11-23 11:22:24,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {236#(= (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)} assume !~bvsge32(~i~0, 0bv32); {240#(not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:24,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {240#(not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {244#(and (not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:24,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {244#(and (not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {211#false} is VALID [2018-11-23 11:22:24,545 INFO L256 TraceCheckUtils]: 11: Hoare triple {211#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {211#false} is VALID [2018-11-23 11:22:24,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2018-11-23 11:22:24,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {211#false} assume 0bv32 == ~cond; {211#false} is VALID [2018-11-23 11:22:24,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 11:22:24,548 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:22:24,549 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:22:24,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:22:24,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:22:24,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:22:24,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:24,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:22:24,724 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:22:24,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:22:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:22:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:22:24,725 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 11:22:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:25,599 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:22:25,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:22:25,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:22:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:22:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 11:22:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:22:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 11:22:25,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-23 11:22:25,721 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:22:25,723 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:22:25,723 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:22:25,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:22:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:22:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:22:25,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:25,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:22:25,755 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:22:25,755 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:22:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:25,757 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:22:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:22:25,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:25,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:25,758 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:22:25,758 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:22:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:25,761 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:22:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:22:25,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:25,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:25,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:25,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:22:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:22:25,765 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 11:22:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:25,765 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:22:25,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:22:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:22:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:22:25,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:25,767 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:22:25,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:25,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:25,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-11-23 11:22:25,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:25,768 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:22:25,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:25,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:25,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2018-11-23 11:22:25,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {392#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {392#true} is VALID [2018-11-23 11:22:25,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 11:22:25,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #63#return; {392#true} is VALID [2018-11-23 11:22:25,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret10 := main(); {392#true} is VALID [2018-11-23 11:22:25,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {392#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {412#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:25,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {412#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~MAX~0); {416#(not (bvslt (_ bv0 32) main_~MAX~0))} is VALID [2018-11-23 11:22:25,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {416#(not (bvslt (_ bv0 32) main_~MAX~0))} 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); {420#(not (bvslt (_ bv0 32) (bvadd main_~i~0 (_ bv1 32))))} is VALID [2018-11-23 11:22:25,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#(not (bvslt (_ bv0 32) (bvadd main_~i~0 (_ bv1 32))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {424#(and (bvsge main_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd main_~i~0 (_ bv1 32)))))} is VALID [2018-11-23 11:22:25,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(and (bvsge main_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd main_~i~0 (_ bv1 32)))))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {428#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd main_~i~0 (_ bv2 32)))))} is VALID [2018-11-23 11:22:25,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd main_~i~0 (_ bv2 32)))))} assume !~bvsge32(~i~0, 0bv32); {393#false} is VALID [2018-11-23 11:22:25,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {393#false} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {393#false} is VALID [2018-11-23 11:22:25,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {393#false} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {393#false} is VALID [2018-11-23 11:22:25,987 INFO L256 TraceCheckUtils]: 13: Hoare triple {393#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {393#false} is VALID [2018-11-23 11:22:25,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {393#false} ~cond := #in~cond; {393#false} is VALID [2018-11-23 11:22:25,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {393#false} assume 0bv32 == ~cond; {393#false} is VALID [2018-11-23 11:22:25,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {393#false} assume !false; {393#false} is VALID [2018-11-23 11:22:25,990 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:22:25,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:26,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {393#false} assume !false; {393#false} is VALID [2018-11-23 11:22:26,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {393#false} assume 0bv32 == ~cond; {393#false} is VALID [2018-11-23 11:22:26,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {393#false} ~cond := #in~cond; {393#false} is VALID [2018-11-23 11:22:26,374 INFO L256 TraceCheckUtils]: 13: Hoare triple {393#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {393#false} is VALID [2018-11-23 11:22:26,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {393#false} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {393#false} is VALID [2018-11-23 11:22:26,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {393#false} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {393#false} is VALID [2018-11-23 11:22:26,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {468#(bvsge main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {393#false} is VALID [2018-11-23 11:22:26,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {472#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {468#(bvsge main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:26,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {476#(or (not (bvsge main_~i~0 (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {472#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:26,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))) (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); {476#(or (not (bvsge main_~i~0 (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:26,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {484#(forall ((main_~MAX~0 (_ BitVec 32))) (or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt main_~i~0 main_~MAX~0)))} assume !~bvslt32(~i~0, ~MAX~0); {480#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:26,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {392#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {484#(forall ((main_~MAX~0 (_ BitVec 32))) (or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt main_~i~0 main_~MAX~0)))} is VALID [2018-11-23 11:22:26,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret10 := main(); {392#true} is VALID [2018-11-23 11:22:26,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #63#return; {392#true} is VALID [2018-11-23 11:22:26,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-23 11:22:26,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {392#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {392#true} is VALID [2018-11-23 11:22:26,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2018-11-23 11:22:26,425 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:22:26,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:26,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:22:26,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 11:22:26,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:26,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:22:26,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:26,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:22:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:22:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:22:26,500 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 12 states. [2018-11-23 11:22:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:29,531 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-23 11:22:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:22:29,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 11:22:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:22:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 100 transitions. [2018-11-23 11:22:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:22:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 100 transitions. [2018-11-23 11:22:29,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 100 transitions. [2018-11-23 11:22:29,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:29,814 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:22:29,814 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:22:29,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:22:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:22:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 29. [2018-11-23 11:22:29,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:29,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 29 states. [2018-11-23 11:22:29,842 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 29 states. [2018-11-23 11:22:29,842 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 29 states. [2018-11-23 11:22:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:29,848 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 11:22:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-11-23 11:22:29,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:29,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:29,850 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 61 states. [2018-11-23 11:22:29,850 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 61 states. [2018-11-23 11:22:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:29,855 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 11:22:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-11-23 11:22:29,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:29,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:29,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:29,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:22:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 11:22:29,859 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2018-11-23 11:22:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:29,860 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 11:22:29,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:22:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:22:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:22:29,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:29,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:29,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:29,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-23 11:22:29,862 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:29,862 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:22:29,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:29,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:30,051 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:22:30,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 11:22:30,283 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 15 treesize of output 12 [2018-11-23 11:22:30,291 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 12 treesize of output 11 [2018-11-23 11:22:30,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-23 11:22:30,445 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 29 treesize of output 30 [2018-11-23 11:22:30,455 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 14 treesize of output 13 [2018-11-23 11:22:30,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-11-23 11:22:30,778 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 38 treesize of output 32 [2018-11-23 11:22:30,797 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:30,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:22:30,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,822 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:30,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 11:22:30,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,863 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:53, output treesize:13 [2018-11-23 11:22:30,874 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:30,875 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, main_~j~0, |main_~#str1~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse2 (bvadd main_~j~0 (_ bv1 32))) (.cse1 ((_ extract 7 0) (select .cse0 (_ bv0 32)))) (.cse3 (select |#memory_int| |main_~#str2~0.base|))) (and (= (select .cse0 main_~j~0) ((_ sign_extend 24) (_ bv0 8))) (= .cse1 |main_#t~mem7|) (bvslt (_ bv0 32) .cse2) (not (bvslt (_ bv1 32) .cse2)) (= (select .cse3 (_ bv0 32)) ((_ sign_extend 24) .cse1)) (= |main_#t~mem8| ((_ extract 7 0) (select .cse3 main_~j~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))))) [2018-11-23 11:22:30,875 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))))) (and (= |main_#t~mem7| .cse0) (= ((_ extract 7 0) ((_ sign_extend 24) .cse0)) |main_#t~mem8|))) [2018-11-23 11:22:30,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-23 11:22:30,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {820#true} is VALID [2018-11-23 11:22:30,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-23 11:22:30,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {820#true} {820#true} #63#return; {820#true} is VALID [2018-11-23 11:22:30,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {820#true} call #t~ret10 := main(); {820#true} is VALID [2018-11-23 11:22:30,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {820#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {840#(and (= (_ 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:22:30,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {840#(and (= (_ 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 !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {844#(and (= (_ 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|)) (bvslt main_~i~0 main_~MAX~0))} is VALID [2018-11-23 11:22:30,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#(and (= (_ 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|)) (bvslt main_~i~0 main_~MAX~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {848#(and (bvslt (_ bv0 32) main_~MAX~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:22:30,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#(and (bvslt (_ bv0 32) main_~MAX~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)))} assume !~bvslt32(~i~0, ~MAX~0); {852#(and (bvslt (_ bv0 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:22:30,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {852#(and (bvslt (_ bv0 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (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); {856#(and (= main_~j~0 (_ bv0 32)) (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:22:30,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {856#(and (= main_~j~0 (_ bv0 32)) (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {860#(and (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:22:31,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {860#(and (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {860#(and (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:22:31,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {860#(and (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !~bvsge32(~i~0, 0bv32); {860#(and (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:22:31,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {860#(and (bvslt (_ bv0 32) main_~MAX~0) (= (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_~#str1~0.offset|) (not (bvslt (_ bv1 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {870#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))) (= main_~i~0 (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~j~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:22:31,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (= (_ bv0 32) |main_~#str2~0.offset|) (= ((_ 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|) |main_~#str2~0.offset|)) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))) (= main_~i~0 (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~j~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {874#(and (= |main_#t~mem7| ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8)))) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))))) |main_#t~mem8|))} is VALID [2018-11-23 11:22:31,030 INFO L256 TraceCheckUtils]: 15: Hoare triple {874#(and (= |main_#t~mem7| ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8)))) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) (_ bv0 8))))) |main_#t~mem8|))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {878#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:31,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {878#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {882#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:31,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {882#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {821#false} is VALID [2018-11-23 11:22:31,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-23 11:22:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:31,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:33,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2018-11-23 11:22:34,082 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2018-11-23 11:22:34,091 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 45 treesize of output 39 [2018-11-23 11:22:34,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:34,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2018-11-23 11:22:42,354 WARN L180 SmtUtils]: Spent 8.12 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:22:44,373 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#str1~0.offset| main_~MAX~0 (_ bv4294967295 32)) |main_~#str1~0.offset|) [2018-11-23 11:22:44,376 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:44,377 INFO L303 Elim1Store]: Index analysis took 2015 ms [2018-11-23 11:22:44,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 44 treesize of output 40 [2018-11-23 11:22:44,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:44,392 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:44,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 27 [2018-11-23 11:22:44,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:44,406 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:22:44,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:44,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 11:22:44,555 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:44,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-23 11:22:44,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:44,702 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:44,712 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:44,730 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:44,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-23 11:22:44,752 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 11:22:44,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:44,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:44,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:44,890 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 1 variables, input treesize:91, output treesize:24 [2018-11-23 11:22:44,913 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:44,914 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (let ((.cse2 (store (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~MAX~0 (_ bv4294967295 32)) ((_ sign_extend 24) (_ bv0 8))))) (let ((.cse1 (store |#memory_int| |main_~#str1~0.base| .cse2))) (let ((.cse0 (store (select .cse1 |main_~#str2~0.base|) |main_~#str2~0.offset| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |main_~#str1~0.offset|)))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store .cse1 |main_~#str2~0.base| .cse0) |main_~#str1~0.base|) |main_~#str1~0.offset|))))))) [2018-11-23 11:22:44,914 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= (bvadd |main_~#str1~0.offset| main_~MAX~0 (_ bv4294967295 32)) |main_~#str1~0.offset|))) (and (or (= |main_~#str1~0.offset| (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))) .cse0) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) .cse0))) [2018-11-23 11:22:46,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-23 11:22:46,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {892#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {821#false} is VALID [2018-11-23 11:22:46,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {896#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {892#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:22:46,541 INFO L256 TraceCheckUtils]: 15: Hoare triple {900#(= ((_ sign_extend 24) |main_#t~mem8|) ((_ sign_extend 24) |main_#t~mem7|))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {896#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:22:46,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {904#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))))} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {900#(= ((_ sign_extend 24) |main_#t~mem8|) ((_ sign_extend 24) |main_#t~mem7|))} is VALID [2018-11-23 11:22:48,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {908#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {904#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))))} is UNKNOWN [2018-11-23 11:22:48,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {908#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} assume !~bvsge32(~i~0, 0bv32); {908#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2018-11-23 11:22:48,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {908#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {908#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2018-11-23 11:22:49,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))) |main_~#str1~0.base|) |main_~#str1~0.offset|))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {908#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2018-11-23 11:22:49,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {922#(and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (bvadd main_~MAX~0 (_ bv4294967295 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); {918#(= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |#memory_int| |main_~#str2~0.base| (store (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))) |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2018-11-23 11:22:49,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {926#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)))) (bvslt main_~i~0 main_~MAX~0))} assume !~bvslt32(~i~0, ~MAX~0); {922#(and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:49,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {930#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {926#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)))) (bvslt main_~i~0 main_~MAX~0))} is VALID [2018-11-23 11:22:49,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {934#(and (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (forall ((v_prenex_2 (_ BitVec 32))) (or (not (bvslt main_~i~0 v_prenex_2)) (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_2) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_2)) (= (bvadd v_prenex_2 (_ bv4294967295 32)) (_ bv0 32)))))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {930#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= |main_~#str1~0.base| |main_~#str2~0.base|) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0))} is VALID [2018-11-23 11:22:49,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {820#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {934#(and (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (forall ((v_prenex_2 (_ BitVec 32))) (or (not (bvslt main_~i~0 v_prenex_2)) (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_2) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_2)) (= (bvadd v_prenex_2 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:49,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {820#true} call #t~ret10 := main(); {820#true} is VALID [2018-11-23 11:22:49,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {820#true} {820#true} #63#return; {820#true} is VALID [2018-11-23 11:22:49,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-23 11:22:49,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {820#true} is VALID [2018-11-23 11:22:49,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-23 11:22:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:49,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:49,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:22:49,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2018-11-23 11:22:49,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:49,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:22:52,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:52,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:22:52,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:22:52,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:22:52,592 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 22 states. [2018-11-23 11:22:53,940 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-11-23 11:22:56,038 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:22:59,003 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-11-23 11:23:03,732 WARN L180 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-11-23 11:23:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:05,032 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 11:23:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:23:05,033 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2018-11-23 11:23:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:23:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 62 transitions. [2018-11-23 11:23:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:23:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 62 transitions. [2018-11-23 11:23:05,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 62 transitions. [2018-11-23 11:23:05,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:05,702 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:23:05,702 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:23:05,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:23:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:23:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-23 11:23:05,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:05,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-23 11:23:05,759 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-23 11:23:05,759 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-23 11:23:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:05,761 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:23:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:23:05,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:05,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:05,762 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-23 11:23:05,763 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-23 11:23:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:05,765 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:23:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:23:05,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:05,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:05,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:05,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:23:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 11:23:05,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2018-11-23 11:23:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:05,768 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 11:23:05,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:23:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 11:23:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:23:05,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:05,769 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:05,770 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:05,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2018-11-23 11:23:05,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:05,771 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:05,800 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:05,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:23:05,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:05,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:05,970 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:23:05,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:05,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:05,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 11:23:06,360 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 19 treesize of output 21 [2018-11-23 11:23:06,369 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:23:06,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-23 11:23:06,606 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 30 treesize of output 26 [2018-11-23 11:23:06,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:23:06,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:06,654 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-23 11:23:06,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:06,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:06,695 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2018-11-23 11:23:06,706 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:06,706 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, main_~j~0, |main_~#str1~0.base|]. (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (_ bv0 32)))) (.cse1 (bvadd main_~j~0 (_ bv1 32))) (.cse2 (select |#memory_int| |main_~#str2~0.base|))) (and (= .cse0 |main_#t~mem7|) (bvslt (_ bv0 32) .cse1) (bvslt (_ bv1 32) .cse1) (= (select .cse2 (_ bv1 32)) ((_ sign_extend 24) .cse0)) (not (bvslt (_ bv2 32) .cse1)) (= |main_#t~mem8| ((_ extract 7 0) (select .cse2 main_~j~0))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) [2018-11-23 11:23:06,707 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_17]. (let ((.cse0 ((_ extract 7 0) v_arrayElimCell_17))) (and (= |main_#t~mem8| ((_ extract 7 0) ((_ sign_extend 24) .cse0))) (= |main_#t~mem7| .cse0))) [2018-11-23 11:23:06,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2018-11-23 11:23:06,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {1168#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1168#true} is VALID [2018-11-23 11:23:06,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2018-11-23 11:23:06,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #63#return; {1168#true} is VALID [2018-11-23 11:23:06,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret10 := main(); {1168#true} is VALID [2018-11-23 11:23:06,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {1168#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {1188#(and (= (_ 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:23:06,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {1188#(and (= (_ 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 !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1188#(and (= (_ 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:23:06,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {1188#(and (= (_ 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|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1195#(and (= (_ 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:23:06,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {1195#(and (= (_ 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 !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1199#(and (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (bvslt main_~i~0 main_~MAX~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:06,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {1199#(and (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (bvslt main_~i~0 main_~MAX~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1203#(and (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~MAX~0) (= (_ bv2 32) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {1203#(and (= (_ bv0 32) |main_~#str1~0.offset|) (= (_ bv0 32) |main_~#str2~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~MAX~0) (= (_ bv2 32) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !~bvslt32(~i~0, ~MAX~0); {1207#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {1207#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (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); {1211#(and (= main_~j~0 (_ bv0 32)) (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {1211#(and (= main_~j~0 (_ bv0 32)) (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1215#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {1215#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1215#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {1215#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (_ bv0 32) |main_~#str2~0.offset|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1222#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |main_~#str1~0.offset|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {1222#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |main_~#str1~0.offset|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1222#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |main_~#str1~0.offset|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {1222#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |main_~#str1~0.offset|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !~bvsge32(~i~0, 0bv32); {1222#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |main_~#str1~0.offset|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:06,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {1222#(and (bvslt (_ bv1 32) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |main_~#str1~0.offset|)))) (= (_ bv0 32) |main_~#str2~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {1232#(and (bvslt (_ bv1 32) main_~MAX~0) (= (bvadd main_~j~0 (_ bv1 32)) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |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:23:06,875 INFO L273 TraceCheckUtils]: 18: Hoare triple {1232#(and (bvslt (_ bv1 32) main_~MAX~0) (= (bvadd main_~j~0 (_ bv1 32)) main_~MAX~0) (= (_ bv0 32) |main_~#str1~0.offset|) (not (bvslt (_ bv2 32) main_~MAX~0)) (= (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|) |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 !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1236#(exists ((v_arrayElimCell_17 (_ BitVec 32))) (and (= |main_#t~mem8| ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_17)))) (= |main_#t~mem7| ((_ extract 7 0) v_arrayElimCell_17))))} is VALID [2018-11-23 11:23:06,877 INFO L256 TraceCheckUtils]: 19: Hoare triple {1236#(exists ((v_arrayElimCell_17 (_ BitVec 32))) (and (= |main_#t~mem8| ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_17)))) (= |main_#t~mem7| ((_ extract 7 0) v_arrayElimCell_17))))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {1240#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:06,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1244#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:06,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {1244#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1169#false} is VALID [2018-11-23 11:23:06,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2018-11-23 11:23:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:06,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:09,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2018-11-23 11:23:09,700 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-11-23 11:23:09,711 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:09,722 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:09,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 11:23:09,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:09,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 11:23:09,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:09,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 11:23:09,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:09,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:09,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:09,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:30 [2018-11-23 11:23:09,968 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:09,968 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (or (not (bvslt (_ bv0 32) main_~MAX~0)) (let ((.cse0 (store (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |#memory_int| |main_~#str2~0.base| .cse0) |main_~#str1~0.base|) |main_~#str1~0.offset|)))))) [2018-11-23 11:23:09,968 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0)) (.cse1 (not (bvslt (_ bv0 32) main_~MAX~0)))) (and (or .cse0 .cse1 (= |main_~#str1~0.offset| (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32)))) (or .cse0 .cse1 (= |main_~#str1~0.base| |main_~#str2~0.base|)))) [2018-11-23 11:23:11,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2018-11-23 11:23:11,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {1254#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1169#false} is VALID [2018-11-23 11:23:11,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {1258#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1254#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:23:11,436 INFO L256 TraceCheckUtils]: 19: Hoare triple {1262#(= ((_ sign_extend 24) |main_#t~mem8|) ((_ sign_extend 24) |main_#t~mem7|))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {1258#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:23:11,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {1266#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0))))) (not (bvslt main_~i~0 main_~MAX~0)))} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1262#(= ((_ sign_extend 24) |main_#t~mem8|) ((_ sign_extend 24) |main_#t~mem7|))} is VALID [2018-11-23 11:23:13,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {1270#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (not (bvslt (_ bv0 32) main_~MAX~0)))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {1266#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0))))) (not (bvslt main_~i~0 main_~MAX~0)))} is UNKNOWN [2018-11-23 11:23:13,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {1270#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (not (bvslt (_ bv0 32) main_~MAX~0)))} assume !~bvsge32(~i~0, 0bv32); {1270#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (not (bvslt (_ bv0 32) main_~MAX~0)))} is VALID [2018-11-23 11:23:13,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {1270#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (not (bvslt (_ bv0 32) main_~MAX~0)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1270#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (not (bvslt (_ bv0 32) main_~MAX~0)))} is VALID [2018-11-23 11:23:13,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#(and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1270#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (not (bvslt (_ bv0 32) main_~MAX~0)))} is VALID [2018-11-23 11:23:13,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {1280#(and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1280#(and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:13,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#(and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1280#(and (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:13,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#(and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))))} 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); {1287#(and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~j~0) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:13,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {1295#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0)))) (bvslt main_~i~0 main_~MAX~0))} assume !~bvslt32(~i~0, ~MAX~0); {1291#(and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0))))} is VALID [2018-11-23 11:23:13,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {1299#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0)))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1295#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0)))) (bvslt main_~i~0 main_~MAX~0))} is VALID [2018-11-23 11:23:14,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {1303#(and (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) v_prenex_4)) (= (bvadd v_prenex_4 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt main_~i~0 v_prenex_4)) (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_4) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_4)))) (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1299#(or (and (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| main_~MAX~0)))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0))} is VALID [2018-11-23 11:23:14,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {1307#(and (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) v_prenex_4)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_4)) (= (bvadd v_prenex_4 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) v_prenex_4) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_4)))) (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (not (bvslt (_ bv0 32) main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1303#(and (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) v_prenex_4)) (= (bvadd v_prenex_4 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt main_~i~0 v_prenex_4)) (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_4) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_4)))) (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~MAX~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:14,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {1307#(and (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) v_prenex_4)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_4)) (= (bvadd v_prenex_4 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) v_prenex_4) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_4)))) (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (not (bvslt (_ bv0 32) main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1307#(and (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) v_prenex_4)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_4)) (= (bvadd v_prenex_4 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) v_prenex_4) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_4)))) (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (not (bvslt (_ bv0 32) main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:14,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {1168#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {1307#(and (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) v_prenex_4)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) v_prenex_4)) (= (bvadd v_prenex_4 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) v_prenex_4) (= (bvadd |main_~#str1~0.offset| (_ bv1 32)) (bvadd |main_~#str2~0.offset| v_prenex_4)))) (or (forall ((main_~MAX~0 (_ BitVec 32))) (or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (not (bvslt (_ bv0 32) main_~MAX~0)))) (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:14,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret10 := main(); {1168#true} is VALID [2018-11-23 11:23:14,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #63#return; {1168#true} is VALID [2018-11-23 11:23:14,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2018-11-23 11:23:14,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {1168#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1168#true} is VALID [2018-11-23 11:23:14,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2018-11-23 11:23:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:14,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 11:23:14,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 23 [2018-11-23 11:23:14,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:14,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:23:17,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:17,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:23:17,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:23:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:23:17,171 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-11-23 11:23:19,549 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2018-11-23 11:23:20,986 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2018-11-23 11:23:21,361 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-23 11:23:22,259 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2018-11-23 11:23:23,954 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-11-23 11:23:24,999 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:23:27,482 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:23:28,284 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:23:30,967 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-23 11:23:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:35,584 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-11-23 11:23:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:23:35,584 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 23 [2018-11-23 11:23:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:23:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 87 transitions. [2018-11-23 11:23:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:23:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 87 transitions. [2018-11-23 11:23:35,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 87 transitions. [2018-11-23 11:23:38,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:38,007 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:23:38,007 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:23:38,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:23:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:23:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2018-11-23 11:23:38,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:38,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 47 states. [2018-11-23 11:23:38,247 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 47 states. [2018-11-23 11:23:38,248 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 47 states. [2018-11-23 11:23:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:38,251 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 11:23:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 11:23:38,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:38,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:38,252 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 64 states. [2018-11-23 11:23:38,252 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 64 states. [2018-11-23 11:23:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:38,255 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 11:23:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 11:23:38,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:38,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:38,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:38,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:23:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 11:23:38,259 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 23 [2018-11-23 11:23:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:38,259 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 11:23:38,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:23:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 11:23:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:23:38,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:38,261 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:38,261 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:38,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash 683083068, now seen corresponding path program 3 times [2018-11-23 11:23:38,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:38,282 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:23:38,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:23:38,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:38,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:38,497 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:23:38,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-23 11:23:38,688 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 19 treesize of output 21 [2018-11-23 11:23:38,726 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:23:38,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-11-23 11:23:39,307 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 34 treesize of output 30 [2018-11-23 11:23:39,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 11:23:39,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:39,373 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:39,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 11:23:39,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:39,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:39,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:39,419 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:11 [2018-11-23 11:23:39,443 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:39,443 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, |main_~#str2~0.offset|, main_~j~0, |main_~#str1~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#str2~0.base|)) (.cse1 ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (_ bv0 32))))) (and (= ((_ extract 7 0) (select .cse0 (bvadd |main_~#str2~0.offset| main_~j~0))) |main_#t~mem8|) (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= .cse1 |main_#t~mem7|) (= (select .cse0 (bvadd |main_~#str2~0.offset| (_ bv1 32))) ((_ sign_extend 24) .cse1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))))) [2018-11-23 11:23:39,443 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_27]. (let ((.cse0 ((_ extract 7 0) v_arrayElimCell_27))) (and (= |main_#t~mem7| .cse0) (= |main_#t~mem8| ((_ extract 7 0) ((_ sign_extend 24) .cse0))))) [2018-11-23 11:23:39,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 11:23:39,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1676#true} is VALID [2018-11-23 11:23:39,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 11:23:39,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #63#return; {1676#true} is VALID [2018-11-23 11:23:39,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret10 := main(); {1676#true} is VALID [2018-11-23 11:23:39,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !~bvslt32(~i~0, ~MAX~0); {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {1696#(and (= (_ bv0 32) |main_~#str1~0.offset|) (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); {1721#(and (= main_~j~0 (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {1721#(and (= main_~j~0 (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (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~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1725#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge main_~i~0 (_ bv0 32)) (= (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:23:39,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {1725#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge main_~i~0 (_ bv0 32)) (= (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~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1729#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~i~0))} is VALID [2018-11-23 11:23:39,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {1729#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~i~0))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1733#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (bvsge main_~i~0 (_ bv0 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|) |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~i~0))} is VALID [2018-11-23 11:23:39,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {1733#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (bvsge main_~i~0 (_ bv0 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|) |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~i~0))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1737#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 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|) |main_~#str1~0.offset|)))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~MAX~0 (_ bv4294967293 32)) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 11:23:39,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {1737#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv0 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|) |main_~#str1~0.offset|)))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~MAX~0 (_ bv4294967293 32)) main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !~bvsge32(~i~0, 0bv32); {1741#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 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|) |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (bvsge (bvadd main_~MAX~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:39,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {1741#(and (= (_ bv0 32) |main_~#str1~0.offset|) (bvsge (bvadd main_~MAX~0 (_ bv4294967294 32)) (_ bv0 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|) |main_~#str1~0.offset|)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (bvsge (bvadd main_~MAX~0 (_ bv4294967293 32)) (_ bv0 32))))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {1745#(and (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (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|) |main_~#str1~0.offset|)))) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:41,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {1745#(and (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |main_~#str1~0.offset|) (= (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|) |main_~#str1~0.offset|)))) (= main_~i~0 (_ bv0 32)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1749#(exists ((v_arrayElimCell_27 (_ BitVec 32))) (and (= |main_#t~mem7| ((_ extract 7 0) v_arrayElimCell_27)) (= |main_#t~mem8| ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_27))))))} is UNKNOWN [2018-11-23 11:23:41,942 INFO L256 TraceCheckUtils]: 21: Hoare triple {1749#(exists ((v_arrayElimCell_27 (_ BitVec 32))) (and (= |main_#t~mem7| ((_ extract 7 0) v_arrayElimCell_27)) (= |main_#t~mem8| ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_27))))))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {1753#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {1753#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1757#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {1757#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1677#false} is VALID [2018-11-23 11:23:41,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 11:23:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:23:41,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:58,887 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-11-23 11:23:58,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2018-11-23 11:23:59,054 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-11-23 11:23:59,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 11:23:59,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:59,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 11:23:59,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:59,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:59,205 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:59,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 11:23:59,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:59,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:59,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:34 [2018-11-23 11:23:59,936 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:59,936 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#str2~0.offset|]. (or (not (bvsge main_~i~0 (_ bv0 32))) (let ((.cse0 (store (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |#memory_int| |main_~#str2~0.base| .cse0) |main_~#str1~0.base|) |main_~#str1~0.offset|))))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:23:59,936 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (not (bvsge main_~i~0 (_ bv0 32)))) (.cse1 (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0)) (.cse2 (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) (and (or .cse0 .cse1 (= |main_~#str1~0.base| |main_~#str2~0.base|) .cse2) (or .cse0 .cse1 .cse2))) [2018-11-23 11:24:00,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 11:24:00,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {1767#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1677#false} is VALID [2018-11-23 11:24:00,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {1771#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1767#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:24:00,385 INFO L256 TraceCheckUtils]: 21: Hoare triple {1775#(= ((_ sign_extend 24) |main_#t~mem8|) ((_ sign_extend 24) |main_#t~mem7|))} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {1771#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:24:00,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {1779#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))))} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {1775#(= ((_ sign_extend 24) |main_#t~mem8|) ((_ sign_extend 24) |main_#t~mem7|))} is VALID [2018-11-23 11:24:02,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {1783#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {1779#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~j~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) (bvadd |main_~#str1~0.offset| main_~i~0)))))} is UNKNOWN [2018-11-23 11:24:02,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {1787#(or (bvsge main_~i~0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))))} assume !~bvsge32(~i~0, 0bv32); {1783#(= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|))))} is VALID [2018-11-23 11:24:02,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {1791#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1787#(or (bvsge main_~i~0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))))} is VALID [2018-11-23 11:24:02,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {1795#(or (not (bvsge main_~i~0 (_ bv0 32))) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1791#(or (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str2~0.base|) (bvadd |main_~#str2~0.offset| main_~MAX~0 (_ bv4294967295 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|)))) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:02,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {1799#(or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1795#(or (not (bvsge main_~i~0 (_ bv0 32))) (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:02,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {1803#(or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~j~0) (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~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1799#(or (= (bvadd main_~MAX~0 (_ bv4294967295 32)) main_~j~0) (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:24:02,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {1676#true} 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); {1803#(or (= (bvadd main_~MAX~0 (_ bv4294967294 32)) main_~j~0) (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:24:02,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1676#true} assume !~bvslt32(~i~0, ~MAX~0); {1676#true} is VALID [2018-11-23 11:24:02,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {1676#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1676#true} is VALID [2018-11-23 11:24:02,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {1676#true} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1676#true} is VALID [2018-11-23 11:24:02,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {1676#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1676#true} is VALID [2018-11-23 11:24:02,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {1676#true} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1676#true} is VALID [2018-11-23 11:24:02,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {1676#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1676#true} is VALID [2018-11-23 11:24:02,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {1676#true} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1676#true} is VALID [2018-11-23 11:24:02,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {1676#true} is VALID [2018-11-23 11:24:02,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret10 := main(); {1676#true} is VALID [2018-11-23 11:24:02,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #63#return; {1676#true} is VALID [2018-11-23 11:24:02,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 11:24:02,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1676#true} is VALID [2018-11-23 11:24:02,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 11:24:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:24:02,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:02,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 11:24:02,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-11-23 11:24:02,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:02,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:24:07,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 34 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:07,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:24:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:24:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=434, Unknown=6, NotChecked=0, Total=506 [2018-11-23 11:24:07,053 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 23 states. [2018-11-23 11:24:07,487 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-11-23 11:24:15,583 WARN L180 SmtUtils]: Spent 6.14 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:24:22,043 WARN L180 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:24:26,588 WARN L180 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-23 11:24:27,247 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-23 11:24:33,700 WARN L180 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-23 11:24:42,532 WARN L180 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-23 11:24:42,882 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-23 11:24:43,526 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-11-23 11:24:44,174 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-11-23 11:24:44,465 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-23 11:24:45,012 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-11-23 11:24:50,146 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-11-23 11:24:52,590 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:24:53,956 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-23 11:24:56,778 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:24:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:57,384 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-23 11:24:57,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:24:57,385 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-11-23 11:24:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:24:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 77 transitions. [2018-11-23 11:24:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:24:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 77 transitions. [2018-11-23 11:24:57,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 77 transitions. [2018-11-23 11:25:02,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:02,068 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:25:02,068 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:25:02,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=345, Invalid=1629, Unknown=6, NotChecked=0, Total=1980 [2018-11-23 11:25:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:25:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2018-11-23 11:25:02,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:02,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 58 states. [2018-11-23 11:25:02,318 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 58 states. [2018-11-23 11:25:02,318 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 58 states. [2018-11-23 11:25:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:02,323 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2018-11-23 11:25:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-11-23 11:25:02,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:02,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:02,324 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 106 states. [2018-11-23 11:25:02,325 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 106 states. [2018-11-23 11:25:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:02,330 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2018-11-23 11:25:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-11-23 11:25:02,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:02,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:02,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:02,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:25:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 11:25:02,333 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 25 [2018-11-23 11:25:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:02,334 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 11:25:02,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:25:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 11:25:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:25:02,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:02,335 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:02,335 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:02,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -194529672, now seen corresponding path program 4 times [2018-11-23 11:25:02,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:02,336 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:02,359 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:25:02,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:25:02,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:02,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:02,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {2349#true} call ULTIMATE.init(); {2349#true} is VALID [2018-11-23 11:25:02,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {2349#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2349#true} is VALID [2018-11-23 11:25:02,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {2349#true} assume true; {2349#true} is VALID [2018-11-23 11:25:02,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2349#true} {2349#true} #63#return; {2349#true} is VALID [2018-11-23 11:25:02,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {2349#true} call #t~ret10 := main(); {2349#true} is VALID [2018-11-23 11:25:02,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {2349#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {2369#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:02,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {2369#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2373#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~MAX~0))} is VALID [2018-11-23 11:25:02,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {2373#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~MAX~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2377#(and (bvslt (_ bv0 32) main_~MAX~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:02,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {2377#(and (bvslt (_ bv0 32) main_~MAX~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2381#(and (bvslt main_~i~0 main_~MAX~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:02,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {2381#(and (bvslt main_~i~0 main_~MAX~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2385#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~MAX~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:25:02,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {2385#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~MAX~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2389#(and (= (_ bv2 32) main_~i~0) (bvslt main_~i~0 main_~MAX~0))} is VALID [2018-11-23 11:25:02,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {2389#(and (= (_ bv2 32) main_~i~0) (bvslt main_~i~0 main_~MAX~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2393#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~MAX~0))} is VALID [2018-11-23 11:25:02,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {2393#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~MAX~0))} assume !~bvslt32(~i~0, ~MAX~0); {2397#(and (bvslt (_ bv2 32) main_~MAX~0) (not (bvslt (_ bv3 32) main_~MAX~0)))} is VALID [2018-11-23 11:25:02,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {2397#(and (bvslt (_ bv2 32) main_~MAX~0) (not (bvslt (_ bv3 32) main_~MAX~0)))} 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); {2401#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv1 32)))))} is VALID [2018-11-23 11:25:02,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {2401#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv1 32)))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2401#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv1 32)))))} is VALID [2018-11-23 11:25:02,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {2401#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv1 32)))))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2408#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv2 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv2 32)))))} is VALID [2018-11-23 11:25:02,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {2408#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv2 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv2 32)))))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2408#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv2 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv2 32)))))} is VALID [2018-11-23 11:25:02,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {2408#(and (bvslt (_ bv2 32) (bvadd main_~i~0 (_ bv2 32))) (not (bvslt (_ bv3 32) (bvadd main_~i~0 (_ bv2 32)))))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2369#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:02,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {2369#(= main_~i~0 (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2369#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:02,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {2369#(= main_~i~0 (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2421#(= (_ bv4294967295 32) main_~i~0)} is VALID [2018-11-23 11:25:02,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {2421#(= (_ bv4294967295 32) main_~i~0)} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2350#false} is VALID [2018-11-23 11:25:02,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {2350#false} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2350#false} is VALID [2018-11-23 11:25:02,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {2350#false} assume !~bvsge32(~i~0, 0bv32); {2350#false} is VALID [2018-11-23 11:25:02,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {2350#false} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {2350#false} is VALID [2018-11-23 11:25:02,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {2350#false} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {2350#false} is VALID [2018-11-23 11:25:02,737 INFO L256 TraceCheckUtils]: 25: Hoare triple {2350#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {2350#false} is VALID [2018-11-23 11:25:02,737 INFO L273 TraceCheckUtils]: 26: Hoare triple {2350#false} ~cond := #in~cond; {2350#false} is VALID [2018-11-23 11:25:02,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {2350#false} assume 0bv32 == ~cond; {2350#false} is VALID [2018-11-23 11:25:02,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {2350#false} assume !false; {2350#false} is VALID [2018-11-23 11:25:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:02,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:03,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {2350#false} assume !false; {2350#false} is VALID [2018-11-23 11:25:03,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {2350#false} assume 0bv32 == ~cond; {2350#false} is VALID [2018-11-23 11:25:03,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {2350#false} ~cond := #in~cond; {2350#false} is VALID [2018-11-23 11:25:03,758 INFO L256 TraceCheckUtils]: 25: Hoare triple {2350#false} call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); {2350#false} is VALID [2018-11-23 11:25:03,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {2350#false} assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); {2350#false} is VALID [2018-11-23 11:25:03,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {2350#false} ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; {2350#false} is VALID [2018-11-23 11:25:03,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {2350#false} assume !~bvsge32(~i~0, 0bv32); {2350#false} is VALID [2018-11-23 11:25:03,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {2350#false} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2350#false} is VALID [2018-11-23 11:25:03,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {2473#(not (bvsge main_~i~0 (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2350#false} is VALID [2018-11-23 11:25:03,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {2477#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2473#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:03,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {2477#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2477#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {2484#(not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2477#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,773 INFO L273 TraceCheckUtils]: 16: Hoare triple {2484#(not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2484#(not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {2491#(not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2484#(not (bvsge (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {2491#(not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2491#(not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {2498#(not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 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); {2491#(not (bvsge (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {2502#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt main_~i~0 main_~MAX~0))} assume !~bvslt32(~i~0, ~MAX~0); {2498#(not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {2506#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2502#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt main_~i~0 main_~MAX~0))} is VALID [2018-11-23 11:25:03,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {2510#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2506#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0))} is VALID [2018-11-23 11:25:03,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {2514#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2510#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)))} is VALID [2018-11-23 11:25:03,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {2518#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (not (bvslt main_~i~0 main_~MAX~0)))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2514#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)))} is VALID [2018-11-23 11:25:03,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {2522#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~MAX~0) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2518#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0) (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (not (bvslt main_~i~0 main_~MAX~0)))} is VALID [2018-11-23 11:25:03,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {2526#(forall ((main_~MAX~0 (_ BitVec 32))) (or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0))))} assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2522#(or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~MAX~0) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0)))} is VALID [2018-11-23 11:25:03,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {2349#true} ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; {2526#(forall ((main_~MAX~0 (_ BitVec 32))) (or (not (bvsge (bvadd main_~MAX~0 (_ bv4294967292 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~MAX~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~MAX~0) (not (bvslt main_~i~0 main_~MAX~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~MAX~0))))} is VALID [2018-11-23 11:25:03,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {2349#true} call #t~ret10 := main(); {2349#true} is VALID [2018-11-23 11:25:03,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2349#true} {2349#true} #63#return; {2349#true} is VALID [2018-11-23 11:25:03,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {2349#true} assume true; {2349#true} is VALID [2018-11-23 11:25:03,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {2349#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2349#true} is VALID [2018-11-23 11:25:03,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {2349#true} call ULTIMATE.init(); {2349#true} is VALID [2018-11-23 11:25:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:03,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-23 11:25:03,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2018-11-23 11:25:03,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:03,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:25:04,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:04,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:25:04,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:25:04,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:25:04,170 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 25 states. [2018-11-23 11:25:06,162 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-23 11:25:06,782 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-11-23 11:25:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:11,339 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-11-23 11:25:11,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:25:11,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2018-11-23 11:25:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:25:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 118 transitions. [2018-11-23 11:25:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:25:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 118 transitions. [2018-11-23 11:25:11,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 118 transitions. [2018-11-23 11:25:11,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:11,751 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:25:11,751 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:25:11,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=442, Invalid=1364, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:25:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:25:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-11-23 11:25:12,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:12,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 77 states. [2018-11-23 11:25:12,225 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 77 states. [2018-11-23 11:25:12,225 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 77 states. [2018-11-23 11:25:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:12,230 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-11-23 11:25:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-11-23 11:25:12,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:12,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:12,231 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 99 states. [2018-11-23 11:25:12,231 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 99 states. [2018-11-23 11:25:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:12,236 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-11-23 11:25:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-11-23 11:25:12,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:12,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:12,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:12,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:25:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-23 11:25:12,240 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 29 [2018-11-23 11:25:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:12,240 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-23 11:25:12,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:25:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-23 11:25:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:25:12,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:12,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:12,242 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:12,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 1 times [2018-11-23 11:25:12,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:12,243 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:12,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:25:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:25:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:25:12,531 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #63#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~MAX~0 := #t~nondet0;havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0bv32;~i~0 := 0bv32; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, ~MAX~0);call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv2 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !~bvslt32(~i~0, ~MAX~0); VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv2 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ 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); VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv0 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !!~bvsge32(~i~0, 0bv32);call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32);call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv2 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] #t~post3 := ~i~0;~i~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv4294967295 32), main_~j~0=(_ bv2 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !~bvsge32(~i~0, 0bv32); VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv4294967295 32), main_~j~0=(_ bv2 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] ~j~0 := ~bvsub32(~MAX~0, 1bv32);~i~0 := 0bv32; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv7 8), |main_#t~mem8|=(_ bv7 8), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #67#return; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv1 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv7 8), |main_#t~mem8|=(_ bv7 8), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv0 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv0 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, ~MAX~0);call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32);call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); VAL [main_~cont~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv0 32), main_~MAX~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv0 8), |main_#t~mem8|=(_ bv7 8), |main_~#str1~0.base|=(_ bv3 32), |main_~#str1~0.offset|=(_ bv0 32), |main_~#str2~0.base|=(_ bv2 32), |main_~#str2~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L13] ~MAX~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0bv32; [L18] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18-L20] assume !!~bvslt32(~i~0, ~MAX~0); [L19] call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L19] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18-L20] assume !!~bvslt32(~i~0, ~MAX~0); [L19] call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L19] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L18-L20] assume !~bvslt32(~i~0, ~MAX~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L21] call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~MAX~0, 1bv32)), 1bv32); [L23] ~j~0 := 0bv32; [L25] ~i~0 := ~bvsub32(~MAX~0, 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L25-L28] assume !!~bvsge32(~i~0, 0bv32); [L26] call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32); [L26] call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25-L28] assume !!~bvsge32(~i~0, 0bv32); [L26] call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32); [L26] call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25-L28] assume !~bvsge32(~i~0, 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L30] ~j~0 := ~bvsub32(~MAX~0, 1bv32); [L31] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L31-L34] assume !!~bvslt32(~i~0, ~MAX~0); [L32] call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L32] call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=1bv32] [L4-L6] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=1bv32] [L3-L8] ensures true; VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=1bv32] [L32] RET call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := ~bvsub32(#t~post9, 1bv32); [L33] havoc #t~post9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31] #t~post6 := ~i~0; [L31] ~i~0 := ~bvadd32(1bv32, #t~post6); [L31] havoc #t~post6; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31-L34] assume !!~bvslt32(~i~0, ~MAX~0); [L32] call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L32] call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=0bv8, #t~mem8=7bv8, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L13] ~MAX~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0bv32; [L18] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18-L20] assume !!~bvslt32(~i~0, ~MAX~0); [L19] call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L19] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18-L20] assume !!~bvslt32(~i~0, ~MAX~0); [L19] call write~intINTTYPE1(#t~nondet2, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L19] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L18-L20] assume !~bvslt32(~i~0, ~MAX~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L21] call write~intINTTYPE1(0bv8, ~#str1~0.base, ~bvadd32(~#str1~0.offset, ~bvsub32(~MAX~0, 1bv32)), 1bv32); [L23] ~j~0 := 0bv32; [L25] ~i~0 := ~bvsub32(~MAX~0, 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L25-L28] assume !!~bvsge32(~i~0, 0bv32); [L26] call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32); [L26] call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25-L28] assume !!~bvsge32(~i~0, 0bv32); [L26] call #t~mem4 := read~intINTTYPE1(~#str1~0.base, ~#str1~0.offset, 1bv32); [L26] call write~intINTTYPE1(#t~mem4, ~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25-L28] assume !~bvsge32(~i~0, 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L30] ~j~0 := ~bvsub32(~MAX~0, 1bv32); [L31] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L31-L34] assume !!~bvslt32(~i~0, ~MAX~0); [L32] call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L32] call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=1bv32] [L4-L6] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=1bv32] [L3-L8] ensures true; VAL [#in~cond=1bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=1bv32] [L32] RET call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := ~bvsub32(#t~post9, 1bv32); [L33] havoc #t~post9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31] #t~post6 := ~i~0; [L31] ~i~0 := ~bvadd32(1bv32, #t~post6); [L31] havoc #t~post6; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31-L34] assume !!~bvslt32(~i~0, ~MAX~0); [L32] call #t~mem7 := read~intINTTYPE1(~#str1~0.base, ~bvadd32(~#str1~0.offset, ~i~0), 1bv32); [L32] call #t~mem8 := read~intINTTYPE1(~#str2~0.base, ~bvadd32(~#str2~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=0bv8, #t~mem8=7bv8, ~#str1~0.base=3bv32, ~#str1~0.offset=0bv32, ~#str2~0.base=2bv32, ~#str2~0.offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] ~MAX~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0bv32; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L18-L20] COND TRUE !~bvslt32(~i~0, ~MAX~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L21] FCALL call write~intINTTYPE1(0bv8, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~bvsub32(~MAX~0, 1bv32)) }, 1bv32); [L23] ~j~0 := 0bv32; [L25] ~i~0 := ~bvsub32(~MAX~0, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25-L28] COND TRUE !~bvsge32(~i~0, 0bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L30] ~j~0 := ~bvsub32(~MAX~0, 1bv32); [L31] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L4] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L32] RET call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := ~bvsub32(#t~post9, 1bv32); [L33] havoc #t~post9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31] #t~post6 := ~i~0; [L31] ~i~0 := ~bvadd32(1bv32, #t~post6); [L31] havoc #t~post6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] ~MAX~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0bv32; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L18-L20] COND TRUE !~bvslt32(~i~0, ~MAX~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L21] FCALL call write~intINTTYPE1(0bv8, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~bvsub32(~MAX~0, 1bv32)) }, 1bv32); [L23] ~j~0 := 0bv32; [L25] ~i~0 := ~bvsub32(~MAX~0, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25-L28] COND TRUE !~bvsge32(~i~0, 0bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L30] ~j~0 := ~bvsub32(~MAX~0, 1bv32); [L31] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L4] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L32] RET call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := ~bvsub32(#t~post9, 1bv32); [L33] havoc #t~post9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31] #t~post6 := ~i~0; [L31] ~i~0 := ~bvadd32(1bv32, #t~post6); [L31] havoc #t~post6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] ~MAX~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0bv32; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L18-L20] COND TRUE !~bvslt32(~i~0, ~MAX~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L21] FCALL call write~intINTTYPE1(0bv8, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~bvsub32(~MAX~0, 1bv32)) }, 1bv32); [L23] ~j~0 := 0bv32; [L25] ~i~0 := ~bvsub32(~MAX~0, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25-L28] COND TRUE !~bvsge32(~i~0, 0bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L30] ~j~0 := ~bvsub32(~MAX~0, 1bv32); [L31] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L4] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L32] RET call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := ~bvsub32(#t~post9, 1bv32); [L33] havoc #t~post9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31] #t~post6 := ~i~0; [L31] ~i~0 := ~bvadd32(1bv32, #t~post6); [L31] havoc #t~post6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] ~MAX~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0bv32; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18-L20] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L19] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~MAX~0=2bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L18-L20] COND TRUE !~bvslt32(~i~0, ~MAX~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=2bv32, ~MAX~0=2bv32] [L21] FCALL call write~intINTTYPE1(0bv8, { base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~bvsub32(~MAX~0, 1bv32)) }, 1bv32); [L23] ~j~0 := 0bv32; [L25] ~i~0 := ~bvsub32(~MAX~0, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L25-L28] COND FALSE !(!~bvsge32(~i~0, 0bv32)) [L26] FCALL call #t~mem4 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1bv32); [L26] FCALL call write~intINTTYPE1(#t~mem4, { base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := ~bvadd32(1bv32, #t~post5); [L27] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25] #t~post3 := ~i~0; [L25] ~i~0 := ~bvsub32(#t~post3, 1bv32); [L25] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L25-L28] COND TRUE !~bvsge32(~i~0, 0bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=4294967295bv32, ~j~0=2bv32, ~MAX~0=2bv32] [L30] ~j~0 := ~bvsub32(~MAX~0, 1bv32); [L31] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L4] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=1bv32] [L32] RET call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=7bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=1bv32, ~MAX~0=2bv32] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := ~bvsub32(#t~post9, 1bv32); [L33] havoc #t~post9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31] #t~post6 := ~i~0; [L31] ~i~0 := ~bvadd32(1bv32, #t~post6); [L31] havoc #t~post6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L31-L34] COND FALSE !(!~bvslt32(~i~0, ~MAX~0)) [L32] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#str1~0!base, offset: ~bvadd32(~#str1~0!offset, ~i~0) }, 1bv32); [L32] FCALL call #t~mem8 := read~intINTTYPE1({ base: ~#str2~0!base, offset: ~bvadd32(~#str2~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, #t~mem8=7bv8, ~#str1~0!base=3bv32, ~#str1~0!offset=0bv32, ~#str2~0!base=2bv32, ~#str2~0!offset=0bv32, ~cont~0=0bv32, ~i~0=1bv32, ~j~0=0bv32, ~MAX~0=2bv32] [L32] CALL call __VERIFIER_assert((if ~sign_extendFrom8To32(#t~mem7) == ~sign_extendFrom8To32(#t~mem8) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L13] int MAX = __VERIFIER_nondet_uint(); [L14] char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={3:0}, str2={2:0}] [L18] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={3:0}, str2={2:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={2:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={3:0}, str2={2:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={2:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={2:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={2:0}] [L31] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={3:0}, str2={2:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={2:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={3:0}, str2={2:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={2:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={2:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={2:0}] [L31] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={3:0}, str2={2:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={2:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={3:0}, str2={2:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={2:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={3:0}, str2={2:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={3:0}, str2={2:0}] [L31] COND TRUE i