java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:01:55,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:01:55,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:01:55,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:01:55,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:01:55,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:01:55,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:01:55,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:01:55,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:01:55,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:01:55,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:01:55,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:01:55,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:01:55,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:01:55,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:01:55,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:01:55,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:01:55,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:01:55,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:01:55,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:01:55,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:01:55,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:01:55,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:01:55,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:01:55,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:01:55,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:01:55,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:01:55,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:01:55,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:01:55,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:01:55,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:01:55,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:01:55,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:01:55,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:01:55,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:01:55,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:01:55,219 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:01:55,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:01:55,252 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:01:55,255 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:01:55,256 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:01:55,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:01:55,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:01:55,257 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:01:55,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:01:55,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:01:55,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:01:55,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:01:55,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:01:55,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:01:55,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:01:55,258 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:01:55,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:01:55,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:01:55,259 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:01:55,259 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:01:55,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:01:55,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:01:55,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:01:55,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:01:55,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:55,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:01:55,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:01:55,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:01:55,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:01:55,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:01:55,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:01:55,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:01:55,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:01:55,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:01:55,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:01:55,331 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:01:55,331 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:01:55,332 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 13:01:55,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a658f14b/8d125b57b7674e6aaa164bea4a54f166/FLAGc73b36b0a [2018-11-23 13:01:55,902 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:01:55,903 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 13:01:55,910 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a658f14b/8d125b57b7674e6aaa164bea4a54f166/FLAGc73b36b0a [2018-11-23 13:01:56,224 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a658f14b/8d125b57b7674e6aaa164bea4a54f166 [2018-11-23 13:01:56,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:01:56,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:01:56,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:56,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:01:56,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:01:56,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176b06ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56, skipping insertion in model container [2018-11-23 13:01:56,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:01:56,282 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:01:56,517 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:56,524 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:01:56,564 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:56,592 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:01:56,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56 WrapperNode [2018-11-23 13:01:56,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:56,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:56,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:01:56,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:01:56,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:56,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:01:56,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:01:56,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:01:56,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... [2018-11-23 13:01:56,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:01:56,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:01:56,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:01:56,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:01:56,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:01:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:01:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:01:56,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:01:56,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:01:56,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:01:56,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:01:56,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:01:56,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:01:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:01:56,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:01:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:01:57,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:01:57,363 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:01:57,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:57 BoogieIcfgContainer [2018-11-23 13:01:57,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:01:57,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:01:57,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:01:57,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:01:57,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:01:56" (1/3) ... [2018-11-23 13:01:57,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b01774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:57, skipping insertion in model container [2018-11-23 13:01:57,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:56" (2/3) ... [2018-11-23 13:01:57,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b01774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:57, skipping insertion in model container [2018-11-23 13:01:57,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:57" (3/3) ... [2018-11-23 13:01:57,373 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-23 13:01:57,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:01:57,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:01:57,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:01:57,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:01:57,455 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:01:57,455 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:01:57,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:01:57,456 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:01:57,456 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:01:57,456 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:01:57,456 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:01:57,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:01:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 13:01:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:01:57,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:57,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:57,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:57,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 13:01:57,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:57,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:57,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:57,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:57,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:57,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 13:01:57,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 13:01:57,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 13:01:57,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 13:01:57,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret10 := main(); {30#true} is VALID [2018-11-23 13:01:57,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {30#true} is VALID [2018-11-23 13:01:57,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 13:01:57,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {31#false} is VALID [2018-11-23 13:01:57,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(~i~0 >= 0); {31#false} is VALID [2018-11-23 13:01:57,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {31#false} is VALID [2018-11-23 13:01:57,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {31#false} is VALID [2018-11-23 13:01:57,673 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {31#false} is VALID [2018-11-23 13:01:57,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 13:01:57,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 13:01:57,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 13:01:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:57,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:01:57,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 13:01:57,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:57,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:01:57,851 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 13:01:57,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:01:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:01:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:01:57,865 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 13:01:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:58,210 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 13:01:58,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:01:58,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 13:01:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:01:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 13:01:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:01:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 13:01:58,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 13:01:58,527 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 13:01:58,540 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:01:58,540 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:01:58,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:01:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:01:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:01:58,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:58,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:01:58,668 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:01:58,668 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:01:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:58,672 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:01:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:01:58,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:58,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:58,673 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:01:58,673 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:01:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:58,677 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:01:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:01:58,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:58,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:58,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:58,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:01:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 13:01:58,684 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 13:01:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:58,684 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 13:01:58,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:01:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:01:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:01:58,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:58,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:58,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:58,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 13:01:58,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:58,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:58,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:58,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-23 13:01:58,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-23 13:01:58,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 13:01:58,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-23 13:01:58,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret10 := main(); {168#true} is VALID [2018-11-23 13:01:58,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {168#true} is VALID [2018-11-23 13:01:58,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {168#true} assume !(~i~0 < ~MAX~0); {168#true} is VALID [2018-11-23 13:01:58,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {168#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {170#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2018-11-23 13:01:58,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {170#(<= main_~MAX~0 (+ main_~i~0 1))} assume !(~i~0 >= 0); {171#(<= main_~MAX~0 0)} is VALID [2018-11-23 13:01:58,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {171#(<= main_~MAX~0 0)} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {172#(and (<= main_~MAX~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:01:58,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {172#(and (<= main_~MAX~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {169#false} is VALID [2018-11-23 13:01:58,888 INFO L256 TraceCheckUtils]: 11: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {169#false} is VALID [2018-11-23 13:01:58,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-23 13:01:58,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2018-11-23 13:01:58,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-23 13:01:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:58,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:01:58,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 13:01:58,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:58,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:01:58,936 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 13:01:58,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:01:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:01:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:01:58,937 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 13:01:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:59,619 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 13:01:59,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:01:59,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 13:01:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:01:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 13:01:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:01:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 13:01:59,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-23 13:01:59,759 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 13:01:59,762 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:01:59,762 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:01:59,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:01:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:01:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:01:59,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:59,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:01:59,780 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:01:59,780 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:01:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:59,782 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:01:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:01:59,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:59,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:59,784 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:01:59,784 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:01:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:59,786 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:01:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:01:59,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:59,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:59,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:59,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:01:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:01:59,790 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 13:01:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:59,791 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:01:59,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:01:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:01:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:01:59,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:59,792 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 13:01:59,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:59,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-11-23 13:01:59,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:59,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2018-11-23 13:01:59,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {308#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {308#true} is VALID [2018-11-23 13:01:59,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2018-11-23 13:01:59,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #63#return; {308#true} is VALID [2018-11-23 13:01:59,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret10 := main(); {308#true} is VALID [2018-11-23 13:01:59,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {308#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {310#(= main_~i~0 0)} is VALID [2018-11-23 13:01:59,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#(= main_~i~0 0)} assume !(~i~0 < ~MAX~0); {311#(<= main_~MAX~0 0)} is VALID [2018-11-23 13:01:59,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#(<= main_~MAX~0 0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {312#(<= (+ main_~i~0 1) 0)} is VALID [2018-11-23 13:01:59,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {312#(<= (+ main_~i~0 1) 0)} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {309#false} is VALID [2018-11-23 13:01:59,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {309#false} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {309#false} is VALID [2018-11-23 13:01:59,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {309#false} assume !(~i~0 >= 0); {309#false} is VALID [2018-11-23 13:01:59,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {309#false} is VALID [2018-11-23 13:01:59,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#false} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {309#false} is VALID [2018-11-23 13:01:59,974 INFO L256 TraceCheckUtils]: 13: Hoare triple {309#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {309#false} is VALID [2018-11-23 13:01:59,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {309#false} ~cond := #in~cond; {309#false} is VALID [2018-11-23 13:01:59,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {309#false} assume 0 == ~cond; {309#false} is VALID [2018-11-23 13:01:59,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {309#false} assume !false; {309#false} is VALID [2018-11-23 13:01:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:59,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:59,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:01:59,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:01:59,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:59,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:00,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:00,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:00,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:00,013 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 13:02:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:00,336 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 13:02:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:02:00,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:02:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-23 13:02:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-23 13:02:00,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2018-11-23 13:02:00,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:00,457 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:02:00,458 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:02:00,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:02:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 13:02:00,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:00,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 24 states. [2018-11-23 13:02:00,507 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 24 states. [2018-11-23 13:02:00,507 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 24 states. [2018-11-23 13:02:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:00,511 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 13:02:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:02:00,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:00,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:00,512 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 29 states. [2018-11-23 13:02:00,512 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 29 states. [2018-11-23 13:02:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:00,515 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 13:02:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:02:00,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:00,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:00,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:00,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:02:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 13:02:00,519 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 13:02:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:00,519 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:02:00,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:02:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:02:00,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:00,521 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 13:02:00,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:00,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-23 13:02:00,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:00,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:00,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:01,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:02:01,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {474#true} is VALID [2018-11-23 13:02:01,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:02:01,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #63#return; {474#true} is VALID [2018-11-23 13:02:01,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret10 := main(); {474#true} is VALID [2018-11-23 13:02:01,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:01,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:01,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:01,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !(~i~0 < ~MAX~0); {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:01,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {476#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {477#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= |main_~#str1~0.offset| 0) (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:01,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {477#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= |main_~#str1~0.offset| 0) (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {478#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= |main_~#str1~0.offset| 0) (<= 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 0)))} is VALID [2018-11-23 13:02:01,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {478#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= |main_~#str1~0.offset| 0) (<= 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 0)))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {479#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 (+ main_~i~0 2)) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 0)))} is VALID [2018-11-23 13:02:01,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {479#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= main_~MAX~0 (+ main_~i~0 2)) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 0)))} assume !(~i~0 >= 0); {480#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~MAX~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 0)))} is VALID [2018-11-23 13:02:01,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {480#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~MAX~0) (<= main_~MAX~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 0)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {481#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= 0 (+ main_~j~0 |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:01,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {481#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= 0 (+ main_~j~0 |main_~#str2~0.offset|)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {482#(= |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 13:02:01,678 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {483#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:02:01,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {483#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {484#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:02:01,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:02:01,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:02:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:02:01,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:01,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:01,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:01,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:01,863 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 13:02:01,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:01,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:01,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 13:02:02,251 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 15 treesize of output 17 [2018-11-23 13:02:02,272 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 13:02:02,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 13:02:02,489 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 28 treesize of output 24 [2018-11-23 13:02:02,501 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:02:02,502 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 15 treesize of output 11 [2018-11-23 13:02:02,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:02:02,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:02,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-23 13:02:02,550 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:02,551 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, main_~j~0, |main_~#str2~0.offset|, |main_~#str1~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#str2~0.base|)) (.cse1 (select (select |#memory_int| |main_~#str1~0.base|) 0))) (and (= |main_#t~mem8| (select .cse0 (+ main_~j~0 |main_~#str2~0.offset|))) (= (select .cse0 |main_~#str2~0.offset|) .cse1) (< 0 (+ main_~j~0 1)) (= |main_#t~mem7| .cse1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 0))) [2018-11-23 13:02:02,551 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem8| |main_#t~mem7|) [2018-11-23 13:02:02,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:02:02,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {474#true} is VALID [2018-11-23 13:02:02,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:02:02,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #63#return; {474#true} is VALID [2018-11-23 13:02:02,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret10 := main(); {474#true} is VALID [2018-11-23 13:02:02,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {503#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:02:02,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {507#(and (= 0 |main_~#str1~0.offset|) (< main_~i~0 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:02:02,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {507#(and (= 0 |main_~#str1~0.offset|) (< main_~i~0 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {511#(and (= 0 |main_~#str1~0.offset|) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2018-11-23 13:02:02,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(and (= 0 |main_~#str1~0.offset|) (<= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {515#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} is VALID [2018-11-23 13:02:02,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {515#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (< 0 main_~MAX~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {519#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (< 0 main_~MAX~0))} is VALID [2018-11-23 13:02:02,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (< 0 main_~MAX~0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {523#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (= (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|)) (< 0 main_~MAX~0))} is VALID [2018-11-23 13:02:02,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {523#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (= (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|)) (< 0 main_~MAX~0))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {523#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (= (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|)) (< 0 main_~MAX~0))} is VALID [2018-11-23 13:02:02,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {523#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (= (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|)) (< 0 main_~MAX~0))} assume !(~i~0 >= 0); {523#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (= (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|)) (< 0 main_~MAX~0))} is VALID [2018-11-23 13:02:02,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {523#(and (<= main_~MAX~0 1) (= 0 |main_~#str1~0.offset|) (= (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|)) (< 0 main_~MAX~0))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {533#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (< 0 (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:02,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {533#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) |main_~#str2~0.offset|)) (< 0 (+ main_~j~0 1)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {482#(= |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 13:02:02,674 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {540#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:02,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {540#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {544#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:02:02,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {544#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:02:02,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:02:02,702 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 13:02:02,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:02,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-23 13:02:02,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-11-23 13:02:02,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:02,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:02:02,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:02,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:02:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:02:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:02:02,852 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 20 states. [2018-11-23 13:02:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:05,559 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 13:02:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:02:05,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-11-23 13:02:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:02:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2018-11-23 13:02:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:02:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2018-11-23 13:02:05,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2018-11-23 13:02:05,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:05,748 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:02:05,748 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:02:05,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:02:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:02:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2018-11-23 13:02:05,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:05,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 39 states. [2018-11-23 13:02:05,942 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 39 states. [2018-11-23 13:02:05,942 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 39 states. [2018-11-23 13:02:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:05,947 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 13:02:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 13:02:05,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:05,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:05,948 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 55 states. [2018-11-23 13:02:05,948 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 55 states. [2018-11-23 13:02:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:05,952 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 13:02:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 13:02:05,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:05,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:05,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:05,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:02:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 13:02:05,957 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 19 [2018-11-23 13:02:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:05,957 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 13:02:05,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:02:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 13:02:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:02:05,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:05,959 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 13:02:05,959 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:05,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2018-11-23 13:02:05,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:05,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:05,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:06,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-23 13:02:06,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {820#true} is VALID [2018-11-23 13:02:06,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-23 13:02:06,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {820#true} {820#true} #63#return; {820#true} is VALID [2018-11-23 13:02:06,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {820#true} call #t~ret10 := main(); {820#true} is VALID [2018-11-23 13:02:06,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {820#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:06,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:06,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {823#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:06,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (= |main_~#str1~0.offset| 0) (<= 1 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {824#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} is VALID [2018-11-23 13:02:06,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {824#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} is VALID [2018-11-23 13:02:06,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {824#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} is VALID [2018-11-23 13:02:06,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {824#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {825#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} is VALID [2018-11-23 13:02:06,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {826#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= 1 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} is VALID [2018-11-23 13:02:06,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= main_~MAX~0 (+ main_~i~0 1)) (= 1 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {827#(and (= 1 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= main_~MAX~0 (+ main_~i~0 2)))} is VALID [2018-11-23 13:02:06,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {827#(and (= 1 (+ main_~j~0 |main_~#str2~0.offset|)) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (<= main_~MAX~0 (+ main_~i~0 2)))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {828#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= main_~MAX~0 (+ main_~i~0 2)))} is VALID [2018-11-23 13:02:06,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {828#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 1)) (<= main_~MAX~0 (+ main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {829#(and (= |main_~#str1~0.offset| 0) (<= main_~MAX~0 (+ main_~i~0 3)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} is VALID [2018-11-23 13:02:06,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {829#(and (= |main_~#str1~0.offset| 0) (<= main_~MAX~0 (+ main_~i~0 3)) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} assume !(~i~0 >= 0); {830#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} is VALID [2018-11-23 13:02:06,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {830#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (<= 2 main_~MAX~0) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) 1)))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {831#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (= main_~i~0 0))} is VALID [2018-11-23 13:02:06,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {831#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0) (= (+ main_~j~0 |main_~#str2~0.offset|) 1) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {832#(= |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 13:02:06,886 INFO L256 TraceCheckUtils]: 19: Hoare triple {832#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {833#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:06,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {833#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {834#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:06,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {834#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {821#false} is VALID [2018-11-23 13:02:06,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-23 13:02:06,896 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 13:02:06,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:06,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:06,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:06,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:06,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:07,053 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 13:02:07,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 13:02:07,325 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 17 treesize of output 19 [2018-11-23 13:02:07,330 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 13:02:07,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-23 13:02:07,533 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 26 treesize of output 22 [2018-11-23 13:02:07,538 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:02:07,539 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 13 treesize of output 9 [2018-11-23 13:02:07,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,551 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:02:07,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:07,566 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 13:02:07,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2018-11-23 13:02:07,568 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:07,569 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, main_~j~0, |main_~#str1~0.base|]. (let ((.cse1 (select (select |#memory_int| |main_~#str1~0.base|) 0)) (.cse0 (select |#memory_int| |main_~#str2~0.base|))) (and (< 0 main_~j~0) (<= main_~j~0 1) (= (select .cse0 1) .cse1) (= |main_#t~mem7| .cse1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select .cse0 main_~j~0) |main_#t~mem8|))) [2018-11-23 13:02:07,569 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem8| |main_#t~mem7|) [2018-11-23 13:02:07,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-23 13:02:07,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {820#true} is VALID [2018-11-23 13:02:07,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-23 13:02:07,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {820#true} {820#true} #63#return; {820#true} is VALID [2018-11-23 13:02:07,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {820#true} call #t~ret10 := main(); {820#true} is VALID [2018-11-23 13:02:07,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {820#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:07,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:07,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {859#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {859#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {863#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (< main_~i~0 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#(and (= |main_~#str1~0.offset| 0) (= main_~i~0 1) (< main_~i~0 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {867#(and (= main_~i~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {867#(and (= main_~i~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !(~i~0 < ~MAX~0); {871#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {871#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {875#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {875#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {879#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~j~0 1))} is VALID [2018-11-23 13:02:07,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {879#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~j~0 1))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {879#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~j~0 1))} is VALID [2018-11-23 13:02:07,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {879#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~j~0 1))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {886#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~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| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {886#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~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| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {886#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~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| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {886#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~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| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !(~i~0 >= 0); {886#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~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| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:07,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {886#(and (<= main_~MAX~0 2) (= |main_~#str1~0.offset| 0) (< 1 main_~MAX~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| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {896#(and (= |main_~#str1~0.offset| 0) (< 0 main_~j~0) (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:07,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {896#(and (= |main_~#str1~0.offset| 0) (< 0 main_~j~0) (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {832#(= |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 13:02:07,619 INFO L256 TraceCheckUtils]: 19: Hoare triple {832#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {833#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:07,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {833#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {834#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:07,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {834#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {821#false} is VALID [2018-11-23 13:02:07,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-23 13:02:07,626 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 13:02:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:07,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-11-23 13:02:07,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-23 13:02:07,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:07,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:02:07,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:07,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:02:07,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:02:07,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:02:07,694 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 23 states. [2018-11-23 13:02:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:11,654 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-23 13:02:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:02:11,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-23 13:02:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:02:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2018-11-23 13:02:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:02:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2018-11-23 13:02:11,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 101 transitions. [2018-11-23 13:02:11,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:11,900 INFO L225 Difference]: With dead ends: 99 [2018-11-23 13:02:11,901 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 13:02:11,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:02:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 13:02:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-23 13:02:12,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:12,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 60 states. [2018-11-23 13:02:12,106 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 60 states. [2018-11-23 13:02:12,107 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 60 states. [2018-11-23 13:02:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:12,112 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-23 13:02:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-11-23 13:02:12,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:12,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:12,114 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 79 states. [2018-11-23 13:02:12,114 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 79 states. [2018-11-23 13:02:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:12,119 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-23 13:02:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-11-23 13:02:12,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:12,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:12,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:12,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:02:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-23 13:02:12,124 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 23 [2018-11-23 13:02:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:12,125 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-23 13:02:12,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:02:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 13:02:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:02:12,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:12,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:12,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:12,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash -96694823, now seen corresponding path program 1 times [2018-11-23 13:02:12,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:12,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:12,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:12,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {1335#true} call ULTIMATE.init(); {1335#true} is VALID [2018-11-23 13:02:12,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {1335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1335#true} is VALID [2018-11-23 13:02:12,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {1335#true} assume true; {1335#true} is VALID [2018-11-23 13:02:12,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1335#true} {1335#true} #63#return; {1335#true} is VALID [2018-11-23 13:02:12,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {1335#true} call #t~ret10 := main(); {1335#true} is VALID [2018-11-23 13:02:12,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {1335#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {1335#true} is VALID [2018-11-23 13:02:12,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {1335#true} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1335#true} is VALID [2018-11-23 13:02:12,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {1335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1335#true} is VALID [2018-11-23 13:02:12,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {1335#true} assume !(~i~0 < ~MAX~0); {1335#true} is VALID [2018-11-23 13:02:12,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {1335#true} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1337#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2018-11-23 13:02:12,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {1337#(<= main_~MAX~0 (+ main_~i~0 1))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1337#(<= main_~MAX~0 (+ main_~i~0 1))} is VALID [2018-11-23 13:02:12,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {1337#(<= main_~MAX~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1338#(<= main_~MAX~0 (+ main_~i~0 2))} is VALID [2018-11-23 13:02:12,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {1338#(<= main_~MAX~0 (+ main_~i~0 2))} assume !(~i~0 >= 0); {1339#(<= main_~MAX~0 1)} is VALID [2018-11-23 13:02:12,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {1339#(<= main_~MAX~0 1)} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:02:12,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:02:12,248 INFO L256 TraceCheckUtils]: 15: Hoare triple {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1335#true} is VALID [2018-11-23 13:02:12,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#true} ~cond := #in~cond; {1335#true} is VALID [2018-11-23 13:02:12,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {1335#true} assume !(0 == ~cond); {1335#true} is VALID [2018-11-23 13:02:12,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {1335#true} assume true; {1335#true} is VALID [2018-11-23 13:02:12,250 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1335#true} {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} #67#return; {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:02:12,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:02:12,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {1340#(and (<= main_~MAX~0 1) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1341#(<= main_~MAX~0 main_~i~0)} is VALID [2018-11-23 13:02:12,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {1341#(<= main_~MAX~0 main_~i~0)} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1336#false} is VALID [2018-11-23 13:02:12,252 INFO L256 TraceCheckUtils]: 23: Hoare triple {1336#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1336#false} is VALID [2018-11-23 13:02:12,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {1336#false} ~cond := #in~cond; {1336#false} is VALID [2018-11-23 13:02:12,253 INFO L273 TraceCheckUtils]: 25: Hoare triple {1336#false} assume 0 == ~cond; {1336#false} is VALID [2018-11-23 13:02:12,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {1336#false} assume !false; {1336#false} is VALID [2018-11-23 13:02:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:02:12,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:12,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:12,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:12,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:12,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {1335#true} call ULTIMATE.init(); {1335#true} is VALID [2018-11-23 13:02:12,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1335#true} is VALID [2018-11-23 13:02:12,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {1335#true} assume true; {1335#true} is VALID [2018-11-23 13:02:12,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1335#true} {1335#true} #63#return; {1335#true} is VALID [2018-11-23 13:02:12,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {1335#true} call #t~ret10 := main(); {1335#true} is VALID [2018-11-23 13:02:12,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {1335#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {1360#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:12,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {1360#(<= main_~i~0 0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1360#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:12,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {1360#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1367#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:12,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {1367#(<= main_~i~0 1)} assume !(~i~0 < ~MAX~0); {1339#(<= main_~MAX~0 1)} is VALID [2018-11-23 13:02:12,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {1339#(<= main_~MAX~0 1)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1339#(<= main_~MAX~0 1)} is VALID [2018-11-23 13:02:12,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#(<= main_~MAX~0 1)} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1339#(<= main_~MAX~0 1)} is VALID [2018-11-23 13:02:12,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {1339#(<= main_~MAX~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1339#(<= main_~MAX~0 1)} is VALID [2018-11-23 13:02:12,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {1339#(<= main_~MAX~0 1)} assume !(~i~0 >= 0); {1339#(<= main_~MAX~0 1)} is VALID [2018-11-23 13:02:12,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1339#(<= main_~MAX~0 1)} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2018-11-23 13:02:12,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2018-11-23 13:02:12,451 INFO L256 TraceCheckUtils]: 15: Hoare triple {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1335#true} is VALID [2018-11-23 13:02:12,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#true} ~cond := #in~cond; {1335#true} is VALID [2018-11-23 13:02:12,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {1335#true} assume !(0 == ~cond); {1335#true} is VALID [2018-11-23 13:02:12,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {1335#true} assume true; {1335#true} is VALID [2018-11-23 13:02:12,454 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1335#true} {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} #67#return; {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2018-11-23 13:02:12,455 INFO L273 TraceCheckUtils]: 20: Hoare triple {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} is VALID [2018-11-23 13:02:12,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {1386#(and (<= 0 main_~i~0) (<= main_~MAX~0 1))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1411#(and (<= 1 main_~i~0) (<= main_~MAX~0 1))} is VALID [2018-11-23 13:02:12,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 1 main_~i~0) (<= main_~MAX~0 1))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1336#false} is VALID [2018-11-23 13:02:12,457 INFO L256 TraceCheckUtils]: 23: Hoare triple {1336#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1336#false} is VALID [2018-11-23 13:02:12,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {1336#false} ~cond := #in~cond; {1336#false} is VALID [2018-11-23 13:02:12,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {1336#false} assume 0 == ~cond; {1336#false} is VALID [2018-11-23 13:02:12,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {1336#false} assume !false; {1336#false} is VALID [2018-11-23 13:02:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:02:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:12,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 13:02:12,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 13:02:12,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:12,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:02:12,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:12,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:02:12,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:02:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:02:12,578 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 11 states. [2018-11-23 13:02:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:13,386 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-23 13:02:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:02:13,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 13:02:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:02:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2018-11-23 13:02:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:02:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2018-11-23 13:02:13,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2018-11-23 13:02:13,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:13,513 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:02:13,514 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:02:13,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:02:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:02:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-11-23 13:02:13,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:13,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 49 states. [2018-11-23 13:02:13,734 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 49 states. [2018-11-23 13:02:13,734 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 49 states. [2018-11-23 13:02:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:13,738 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 13:02:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 13:02:13,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:13,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:13,739 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 58 states. [2018-11-23 13:02:13,739 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 58 states. [2018-11-23 13:02:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:13,742 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 13:02:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 13:02:13,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:13,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:13,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:13,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:02:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 13:02:13,746 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 27 [2018-11-23 13:02:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:13,746 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 13:02:13,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:02:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 13:02:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:02:13,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:13,747 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:13,747 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:13,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2018-11-23 13:02:13,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:14,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {1740#true} call ULTIMATE.init(); {1740#true} is VALID [2018-11-23 13:02:14,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {1740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1740#true} is VALID [2018-11-23 13:02:14,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {1740#true} assume true; {1740#true} is VALID [2018-11-23 13:02:14,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} #63#return; {1740#true} is VALID [2018-11-23 13:02:14,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {1740#true} call #t~ret10 := main(); {1740#true} is VALID [2018-11-23 13:02:14,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {1740#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1743#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= main_~MAX~0 (+ main_~i~0 1)))))} is VALID [2018-11-23 13:02:14,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {1743#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= main_~MAX~0 (+ main_~i~0 1)))))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1744#(and (or (= main_~MAX~0 (+ main_~i~0 1)) (< (+ main_~i~0 1) main_~MAX~0)) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= main_~MAX~0 (+ main_~i~0 1)))))} is VALID [2018-11-23 13:02:14,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {1744#(and (or (= main_~MAX~0 (+ main_~i~0 1)) (< (+ main_~i~0 1) main_~MAX~0)) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (not (= main_~MAX~0 (+ main_~i~0 1)))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1745#(and (= |main_~#str1~0.offset| 0) (or (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {1745#(and (= |main_~#str1~0.offset| 0) (or (<= (+ main_~i~0 1) main_~MAX~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (= |main_~#str2~0.offset| 0))} assume !(~i~0 < ~MAX~0); {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {1742#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1746#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0) (= (+ main_~i~0 1) main_~MAX~0))} is VALID [2018-11-23 13:02:14,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {1746#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= |main_~#str2~0.offset| 0) (= (+ main_~i~0 1) main_~MAX~0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1747#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= (+ main_~i~0 main_~j~0) main_~MAX~0))} is VALID [2018-11-23 13:02:14,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {1747#(and (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= |main_~#str2~0.offset| 0) (= (+ main_~i~0 main_~j~0) main_~MAX~0))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1748#(and (= |main_~#str1~0.offset| 0) (or (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 main_~j~0 1) main_~MAX~0)) (<= main_~i~0 0)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1748#(and (= |main_~#str1~0.offset| 0) (or (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 main_~j~0 1) main_~MAX~0)) (<= main_~i~0 0)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1749#(and (= |main_~#str1~0.offset| 0) (or (<= (+ |main_~#str2~0.offset| 2) (+ |main_~#str1~0.offset| main_~i~0)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~MAX~0))) (<= main_~i~0 0)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {1749#(and (= |main_~#str1~0.offset| 0) (or (<= (+ |main_~#str2~0.offset| 2) (+ |main_~#str1~0.offset| main_~i~0)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~MAX~0))) (<= main_~i~0 0)) (= |main_~#str2~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1750#(and (= |main_~#str1~0.offset| 0) (or (<= (+ |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~i~0)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~MAX~0))) (<= (+ main_~i~0 1) 0)) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {1750#(and (= |main_~#str1~0.offset| 0) (or (<= (+ |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~i~0)) (and (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~j~0 |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~MAX~0))) (<= (+ main_~i~0 1) 0)) (= |main_~#str2~0.offset| 0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1751#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~MAX~0 (- 1))))) (<= (+ |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~i~0))))} is VALID [2018-11-23 13:02:14,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {1751#(and (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0) (or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~MAX~0 (- 1))))) (<= (+ |main_~#str2~0.offset| 1) (+ |main_~#str1~0.offset| main_~i~0))))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1752#(and (= |main_~#str1~0.offset| 0) (or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~MAX~0 (- 1))))) (<= |main_~#str2~0.offset| (+ |main_~#str1~0.offset| main_~i~0))) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {1752#(and (= |main_~#str1~0.offset| 0) (or (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~MAX~0 (- 1))))) (<= |main_~#str2~0.offset| (+ |main_~#str1~0.offset| main_~i~0))) (= |main_~#str2~0.offset| 0))} assume !(~i~0 >= 0); {1753#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~MAX~0 (- 1))))) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0))} is VALID [2018-11-23 13:02:14,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {1753#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str1~0.offset| (+ main_~MAX~0 (- 1))))) (= |main_~#str1~0.offset| 0) (= |main_~#str2~0.offset| 0))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1754#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:02:14,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {1754#(and (= |main_~#str1~0.offset| 0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ main_~i~0 |main_~#str1~0.offset|)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| main_~j~0))) (= |main_~#str2~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1755#(= |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 13:02:14,803 INFO L256 TraceCheckUtils]: 23: Hoare triple {1755#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1756#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:14,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {1756#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1757#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:14,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {1757#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1741#false} is VALID [2018-11-23 13:02:14,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2018-11-23 13:02:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:02:14,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:14,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:02:14,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:02:14,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:14,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:15,009 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 13:02:15,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 13:02:15,339 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 17 treesize of output 19 [2018-11-23 13:02:15,343 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 13:02:15,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 13:02:15,651 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 13:02:15,657 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:02:15,657 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 17 treesize of output 13 [2018-11-23 13:02:15,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,670 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:02:15,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:15,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-23 13:02:15,686 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:15,687 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#str2~0.base|, main_~j~0, |main_~#str2~0.offset|, |main_~#str1~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#str2~0.base|)) (.cse1 (select (select |#memory_int| |main_~#str1~0.base|) 0))) (and (<= 2 main_~j~0) (= |main_#t~mem8| (select .cse0 (+ main_~j~0 |main_~#str2~0.offset|))) (= |main_#t~mem7| .cse1) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 2) (= (select .cse0 (+ |main_~#str2~0.offset| 2)) .cse1))) [2018-11-23 13:02:15,687 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem8| |main_#t~mem7|) [2018-11-23 13:02:15,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {1740#true} call ULTIMATE.init(); {1740#true} is VALID [2018-11-23 13:02:15,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {1740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1740#true} is VALID [2018-11-23 13:02:15,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {1740#true} assume true; {1740#true} is VALID [2018-11-23 13:02:15,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} #63#return; {1740#true} is VALID [2018-11-23 13:02:15,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {1740#true} call #t~ret10 := main(); {1740#true} is VALID [2018-11-23 13:02:15,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {1740#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; {1776#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:02:15,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {1776#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1776#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-23 13:02:15,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {1776#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:02:15,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:02:15,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:02:15,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:02:15,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:02:15,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 < ~MAX~0); {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-23 13:02:15,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {1783#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {1802#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= (+ main_~i~0 1) main_~MAX~0))} is VALID [2018-11-23 13:02:15,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {1802#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (= (+ main_~i~0 1) main_~MAX~0))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1806#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (= (+ main_~i~0 1) main_~MAX~0))} is VALID [2018-11-23 13:02:15,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {1806#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (= (+ main_~i~0 1) main_~MAX~0))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1810#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 2)) (= main_~j~0 1))} is VALID [2018-11-23 13:02:15,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 2)) (= main_~j~0 1))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1814#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 2)))} is VALID [2018-11-23 13:02:15,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {1814#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 2)))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1818#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:02:15,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {1818#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 3)))} assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1822#(and (<= 0 main_~i~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| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:02:15,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {1822#(and (<= 0 main_~i~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| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~MAX~0 (+ main_~i~0 3)))} #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; {1826#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= 3 main_~MAX~0) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 4)))} is VALID [2018-11-23 13:02:15,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {1826#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= 3 main_~MAX~0) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 (+ main_~i~0 4)))} assume !(~i~0 >= 0); {1830#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= 3 main_~MAX~0) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 3))} is VALID [2018-11-23 13:02:15,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {1830#(and (= (select (select |#memory_int| |main_~#str1~0.base|) |main_~#str1~0.offset|) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= 3 main_~MAX~0) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~MAX~0 3))} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {1834#(and (<= 2 main_~j~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| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 2) (= main_~i~0 0))} is VALID [2018-11-23 13:02:15,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {1834#(and (<= 2 main_~j~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| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~j~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {1755#(= |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 13:02:15,724 INFO L256 TraceCheckUtils]: 23: Hoare triple {1755#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1756#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:15,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {1756#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1757#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:15,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {1757#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1741#false} is VALID [2018-11-23 13:02:15,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2018-11-23 13:02:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:02:15,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:15,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2018-11-23 13:02:15,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 27 [2018-11-23 13:02:15,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:15,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:02:15,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:15,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:02:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:02:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:02:15,802 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 29 states. [2018-11-23 13:02:19,148 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-23 13:02:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:22,521 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 13:02:22,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:02:22,521 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 27 [2018-11-23 13:02:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:02:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 72 transitions. [2018-11-23 13:02:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:02:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 72 transitions. [2018-11-23 13:02:22,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 72 transitions. [2018-11-23 13:02:22,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:22,667 INFO L225 Difference]: With dead ends: 91 [2018-11-23 13:02:22,667 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:02:22,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=694, Invalid=3212, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 13:02:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:02:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2018-11-23 13:02:22,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:22,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 55 states. [2018-11-23 13:02:22,923 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 55 states. [2018-11-23 13:02:22,923 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 55 states. [2018-11-23 13:02:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:22,927 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-11-23 13:02:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2018-11-23 13:02:22,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:22,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:22,928 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 89 states. [2018-11-23 13:02:22,929 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 89 states. [2018-11-23 13:02:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:22,933 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-11-23 13:02:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2018-11-23 13:02:22,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:22,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:22,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:22,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:02:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-23 13:02:22,936 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 27 [2018-11-23 13:02:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:22,936 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-23 13:02:22,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:02:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-23 13:02:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:02:22,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:22,937 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 13:02:22,938 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:22,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 2 times [2018-11-23 13:02:22,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:22,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:22,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:23,014 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6, |#NULL.offset|=3, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);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 := 0;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~cont~0=0, main_~i~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~cont~0=0, main_~i~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~cont~0=0, main_~i~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~cont~0=0, main_~i~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 < ~MAX~0); VAL [main_~cont~0=0, main_~i~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 >= 0); VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] ~j~0 := ~MAX~0 - 1;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #67#return; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [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={4:0}, str2={5: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={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5: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={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 >= 0); VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] ~j~0 := ~MAX~0 - 1;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #67#return; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [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 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [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={4:0}, str2={5: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={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5: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={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5: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={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5: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={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i