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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:32:15,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:32:15,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:32:15,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:32:15,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:32:15,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:32:15,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:32:15,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:32:15,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:32:15,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:32:15,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:32:15,565 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:32:15,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:32:15,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:32:15,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:32:15,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:32:15,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:32:15,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:32:15,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:32:15,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:32:15,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:32:15,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:32:15,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:32:15,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:32:15,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:32:15,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:32:15,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:32:15,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:32:15,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:32:15,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:32:15,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:32:15,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:32:15,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:32:15,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:32:15,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:32:15,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:32:15,589 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-14 17:32:15,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:32:15,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:32:15,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:32:15,605 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:32:15,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:32:15,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:32:15,606 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:32:15,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:32:15,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:32:15,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:32:15,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:32:15,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:32:15,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:32:15,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:32:15,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:32:15,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:32:15,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:32:15,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:32:15,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:32:15,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:32:15,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:32:15,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:32:15,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:32:15,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:32:15,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:32:15,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:32:15,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:32:15,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:32:15,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:32:15,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:32:15,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:32:15,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:32:15,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:32:15,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:32:15,672 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:32:15,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i [2018-11-14 17:32:15,736 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05c09d7a/51a2bf370bc7403897378a1fe4810df8/FLAGbf922a891 [2018-11-14 17:32:16,145 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:32:16,146 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i [2018-11-14 17:32:16,152 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05c09d7a/51a2bf370bc7403897378a1fe4810df8/FLAGbf922a891 [2018-11-14 17:32:16,169 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05c09d7a/51a2bf370bc7403897378a1fe4810df8 [2018-11-14 17:32:16,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:32:16,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:32:16,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:32:16,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:32:16,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:32:16,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6150c6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16, skipping insertion in model container [2018-11-14 17:32:16,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:32:16,228 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:32:16,490 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:32:16,496 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:32:16,517 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:32:16,539 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:32:16,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16 WrapperNode [2018-11-14 17:32:16,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:32:16,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:32:16,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:32:16,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:32:16,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (1/1) ... [2018-11-14 17:32:16,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:32:16,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:32:16,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:32:16,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:32:16,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (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-14 17:32:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:32:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:32:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:32:16,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:32:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:32:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:32:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:32:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:32:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:32:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:32:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:32:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:32:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:32:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:32:17,185 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:32:17,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:17 BoogieIcfgContainer [2018-11-14 17:32:17,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:32:17,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:32:17,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:32:17,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:32:17,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:32:16" (1/3) ... [2018-11-14 17:32:17,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc7ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:17, skipping insertion in model container [2018-11-14 17:32:17,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:16" (2/3) ... [2018-11-14 17:32:17,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc7ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:17, skipping insertion in model container [2018-11-14 17:32:17,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:17" (3/3) ... [2018-11-14 17:32:17,194 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call2_true-termination.i [2018-11-14 17:32:17,204 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:32:17,211 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:32:17,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:32:17,255 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:32:17,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:32:17,256 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:32:17,256 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:32:17,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:32:17,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:32:17,257 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:32:17,257 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:32:17,257 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:32:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 17:32:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:32:17,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:17,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:17,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:17,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash -173834890, now seen corresponding path program 1 times [2018-11-14 17:32:17,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:17,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:17,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:17,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:17,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 17:32:17,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25#true} is VALID [2018-11-14 17:32:17,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 17:32:17,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #36#return; {25#true} is VALID [2018-11-14 17:32:17,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2018-11-14 17:32:17,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {25#true} is VALID [2018-11-14 17:32:17,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 17:32:17,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {26#false} is VALID [2018-11-14 17:32:17,447 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {26#false} is VALID [2018-11-14 17:32:17,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 17:32:17,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume ~cond == 0; {26#false} is VALID [2018-11-14 17:32:17,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 17:32:17,452 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-14 17:32:17,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:32:17,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:32:17,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 17:32:17,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:17,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:32:17,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:17,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:32:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:32:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:32:17,530 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 17:32:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:17,654 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:32:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:32:17,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 17:32:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:32:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-14 17:32:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:32:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-14 17:32:17,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-14 17:32:18,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:18,039 INFO L225 Difference]: With dead ends: 35 [2018-11-14 17:32:18,039 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 17:32:18,042 INFO L604 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-14 17:32:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 17:32:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 17:32:18,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:18,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 17:32:18,169 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 17:32:18,169 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 17:32:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:18,172 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 17:32:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 17:32:18,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:18,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:18,174 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 17:32:18,174 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 17:32:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:18,177 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 17:32:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 17:32:18,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:18,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:18,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:18,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:32:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 17:32:18,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-14 17:32:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:18,185 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 17:32:18,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:32:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 17:32:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:32:18,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:18,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:18,188 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:18,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash -737648989, now seen corresponding path program 1 times [2018-11-14 17:32:18,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:18,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:18,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-14 17:32:18,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {125#true} is VALID [2018-11-14 17:32:18,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-14 17:32:18,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #36#return; {125#true} is VALID [2018-11-14 17:32:18,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret4 := main(); {125#true} is VALID [2018-11-14 17:32:18,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {127#(= main_~i~0 0)} is VALID [2018-11-14 17:32:18,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(= main_~i~0 0)} assume true; {127#(= main_~i~0 0)} is VALID [2018-11-14 17:32:18,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#(= main_~i~0 0)} assume !(~i~0 < 2048); {126#false} is VALID [2018-11-14 17:32:18,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {126#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {126#false} is VALID [2018-11-14 17:32:18,463 INFO L256 TraceCheckUtils]: 9: Hoare triple {126#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {126#false} is VALID [2018-11-14 17:32:18,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {126#false} ~cond := #in~cond; {126#false} is VALID [2018-11-14 17:32:18,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {126#false} assume ~cond == 0; {126#false} is VALID [2018-11-14 17:32:18,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-14 17:32:18,466 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-14 17:32:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:32:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:32:18,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 17:32:18,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:18,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:32:18,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:18,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:32:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:32:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:32:18,518 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2018-11-14 17:32:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:18,701 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:32:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:32:18,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 17:32:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:32:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-14 17:32:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:32:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-14 17:32:18,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2018-11-14 17:32:18,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:18,786 INFO L225 Difference]: With dead ends: 24 [2018-11-14 17:32:18,786 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:32:18,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:32:18,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:32:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 17:32:18,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:18,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 17:32:18,799 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 17:32:18,799 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 17:32:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:18,802 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:32:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:32:18,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:18,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:18,802 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 17:32:18,802 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 17:32:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:18,804 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:32:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:32:18,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:18,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:18,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:18,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:32:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 17:32:18,807 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-14 17:32:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:18,808 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 17:32:18,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:32:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:32:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:32:18,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:18,809 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:18,809 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:18,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1154592614, now seen corresponding path program 1 times [2018-11-14 17:32:18,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:18,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:18,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-14 17:32:18,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-14 17:32:18,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-14 17:32:18,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #36#return; {225#true} is VALID [2018-11-14 17:32:18,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret4 := main(); {225#true} is VALID [2018-11-14 17:32:18,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {227#(= main_~i~0 0)} is VALID [2018-11-14 17:32:18,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {227#(= main_~i~0 0)} assume true; {227#(= main_~i~0 0)} is VALID [2018-11-14 17:32:18,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {227#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {227#(= main_~i~0 0)} is VALID [2018-11-14 17:32:18,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {227#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {228#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:18,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(<= main_~i~0 1)} assume true; {228#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:18,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {228#(<= main_~i~0 1)} assume !(~i~0 < 2048); {226#false} is VALID [2018-11-14 17:32:18,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {226#false} is VALID [2018-11-14 17:32:18,930 INFO L256 TraceCheckUtils]: 12: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {226#false} is VALID [2018-11-14 17:32:18,930 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-14 17:32:18,930 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#false} assume ~cond == 0; {226#false} is VALID [2018-11-14 17:32:18,931 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-14 17:32:18,932 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-14 17:32:18,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:18,932 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-14 17:32:18,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:18,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:19,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-14 17:32:19,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-14 17:32:19,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-14 17:32:19,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #36#return; {225#true} is VALID [2018-11-14 17:32:19,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret4 := main(); {225#true} is VALID [2018-11-14 17:32:19,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {247#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:19,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {247#(<= main_~i~0 0)} assume true; {247#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:19,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {247#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {247#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:19,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {247#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {228#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:19,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(<= main_~i~0 1)} assume true; {228#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:19,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {228#(<= main_~i~0 1)} assume !(~i~0 < 2048); {226#false} is VALID [2018-11-14 17:32:19,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {226#false} is VALID [2018-11-14 17:32:19,232 INFO L256 TraceCheckUtils]: 12: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {226#false} is VALID [2018-11-14 17:32:19,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-14 17:32:19,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#false} assume ~cond == 0; {226#false} is VALID [2018-11-14 17:32:19,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-14 17:32:19,234 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-14 17:32:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:32:19,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:32:19,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:19,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:32:19,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:19,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:32:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:32:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:32:19,438 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-11-14 17:32:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:19,720 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:32:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:32:19,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:32:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:32:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-14 17:32:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:32:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-14 17:32:19,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-14 17:32:19,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:19,880 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:32:19,880 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 17:32:19,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:32:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 17:32:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-14 17:32:19,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:19,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-14 17:32:19,892 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-14 17:32:19,892 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-14 17:32:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:19,894 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:32:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:32:19,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:19,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:19,895 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-14 17:32:19,896 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-14 17:32:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:19,898 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:32:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:32:19,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:19,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:19,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:19,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:32:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 17:32:19,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-11-14 17:32:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:19,905 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 17:32:19,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:32:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:32:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:32:19,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:19,906 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:19,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:19,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1276704957, now seen corresponding path program 2 times [2018-11-14 17:32:19,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:19,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:20,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-14 17:32:20,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {386#true} is VALID [2018-11-14 17:32:20,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:32:20,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #36#return; {386#true} is VALID [2018-11-14 17:32:20,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret4 := main(); {386#true} is VALID [2018-11-14 17:32:20,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {388#(= main_~i~0 0)} is VALID [2018-11-14 17:32:20,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {388#(= main_~i~0 0)} assume true; {388#(= main_~i~0 0)} is VALID [2018-11-14 17:32:20,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {388#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {388#(= main_~i~0 0)} is VALID [2018-11-14 17:32:20,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {388#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {389#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(<= main_~i~0 1)} assume true; {389#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {389#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {390#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {390#(<= main_~i~0 2)} assume true; {390#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(<= main_~i~0 2)} assume !(~i~0 < 2048); {387#false} is VALID [2018-11-14 17:32:20,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {387#false} is VALID [2018-11-14 17:32:20,056 INFO L256 TraceCheckUtils]: 15: Hoare triple {387#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {387#false} is VALID [2018-11-14 17:32:20,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {387#false} ~cond := #in~cond; {387#false} is VALID [2018-11-14 17:32:20,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {387#false} assume ~cond == 0; {387#false} is VALID [2018-11-14 17:32:20,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-14 17:32:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:20,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:20,058 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-14 17:32:20,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:20,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:20,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:20,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:20,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-14 17:32:20,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {386#true} is VALID [2018-11-14 17:32:20,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 17:32:20,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #36#return; {386#true} is VALID [2018-11-14 17:32:20,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret4 := main(); {386#true} is VALID [2018-11-14 17:32:20,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {409#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:20,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {409#(<= main_~i~0 0)} assume true; {409#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:20,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {409#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {409#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:20,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {409#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {389#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(<= main_~i~0 1)} assume true; {389#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {389#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {390#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {390#(<= main_~i~0 2)} assume true; {390#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(<= main_~i~0 2)} assume !(~i~0 < 2048); {387#false} is VALID [2018-11-14 17:32:20,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {387#false} is VALID [2018-11-14 17:32:20,303 INFO L256 TraceCheckUtils]: 15: Hoare triple {387#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {387#false} is VALID [2018-11-14 17:32:20,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {387#false} ~cond := #in~cond; {387#false} is VALID [2018-11-14 17:32:20,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {387#false} assume ~cond == 0; {387#false} is VALID [2018-11-14 17:32:20,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-14 17:32:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:20,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:20,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:32:20,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 17:32:20,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:20,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:32:20,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:20,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:32:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:32:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:32:20,389 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 6 states. [2018-11-14 17:32:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:20,529 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:32:20,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:32:20,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 17:32:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:32:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-14 17:32:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:32:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-14 17:32:20,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2018-11-14 17:32:20,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:20,586 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:32:20,586 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:32:20,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:32:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:32:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-14 17:32:20,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:20,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-14 17:32:20,648 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-14 17:32:20,648 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-14 17:32:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:20,650 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:32:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:32:20,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:20,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:20,651 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-14 17:32:20,651 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-14 17:32:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:20,654 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:32:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:32:20,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:20,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:20,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:20,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:32:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-14 17:32:20,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-11-14 17:32:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:20,657 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-14 17:32:20,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:32:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:32:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:32:20,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:20,659 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:20,660 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:20,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1288215558, now seen corresponding path program 3 times [2018-11-14 17:32:20,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:20,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:20,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:20,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:20,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2018-11-14 17:32:20,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {571#true} is VALID [2018-11-14 17:32:20,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 17:32:20,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #36#return; {571#true} is VALID [2018-11-14 17:32:20,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret4 := main(); {571#true} is VALID [2018-11-14 17:32:20,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {571#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {573#(= main_~i~0 0)} is VALID [2018-11-14 17:32:20,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#(= main_~i~0 0)} assume true; {573#(= main_~i~0 0)} is VALID [2018-11-14 17:32:20,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {573#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {573#(= main_~i~0 0)} is VALID [2018-11-14 17:32:20,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {574#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#(<= main_~i~0 1)} assume true; {574#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {574#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {575#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {575#(<= main_~i~0 2)} assume true; {575#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {575#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {575#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {575#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {576#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:20,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {576#(<= main_~i~0 3)} assume true; {576#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:20,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#(<= main_~i~0 3)} assume !(~i~0 < 2048); {572#false} is VALID [2018-11-14 17:32:20,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {572#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {572#false} is VALID [2018-11-14 17:32:20,811 INFO L256 TraceCheckUtils]: 18: Hoare triple {572#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {572#false} is VALID [2018-11-14 17:32:20,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2018-11-14 17:32:20,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {572#false} assume ~cond == 0; {572#false} is VALID [2018-11-14 17:32:20,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {572#false} assume !false; {572#false} is VALID [2018-11-14 17:32:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:20,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:20,815 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-14 17:32:20,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:32:20,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:32:20,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:20,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:20,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2018-11-14 17:32:20,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {571#true} is VALID [2018-11-14 17:32:20,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 17:32:20,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #36#return; {571#true} is VALID [2018-11-14 17:32:20,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret4 := main(); {571#true} is VALID [2018-11-14 17:32:20,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {571#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {595#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:20,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#(<= main_~i~0 0)} assume true; {595#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:20,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {595#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {595#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:20,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {595#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {574#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#(<= main_~i~0 1)} assume true; {574#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {574#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:20,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {575#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {575#(<= main_~i~0 2)} assume true; {575#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {575#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {575#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:20,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {575#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {576#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:20,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {576#(<= main_~i~0 3)} assume true; {576#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:20,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#(<= main_~i~0 3)} assume !(~i~0 < 2048); {572#false} is VALID [2018-11-14 17:32:20,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {572#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {572#false} is VALID [2018-11-14 17:32:20,980 INFO L256 TraceCheckUtils]: 18: Hoare triple {572#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {572#false} is VALID [2018-11-14 17:32:20,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2018-11-14 17:32:20,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {572#false} assume ~cond == 0; {572#false} is VALID [2018-11-14 17:32:20,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {572#false} assume !false; {572#false} is VALID [2018-11-14 17:32:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:21,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:21,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:32:21,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-14 17:32:21,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:21,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:32:21,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:21,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:32:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:32:21,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:32:21,091 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-11-14 17:32:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:21,179 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:32:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:32:21,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-14 17:32:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:32:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-14 17:32:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:32:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-14 17:32:21,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-14 17:32:21,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:21,229 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:32:21,229 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:32:21,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:32:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:32:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-14 17:32:21,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:21,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-14 17:32:21,243 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-14 17:32:21,244 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-14 17:32:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:21,246 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:32:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:32:21,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:21,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:21,247 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-14 17:32:21,247 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-14 17:32:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:21,249 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:32:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:32:21,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:21,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:21,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:21,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:32:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 17:32:21,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-11-14 17:32:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:21,252 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 17:32:21,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:32:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:32:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:32:21,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:21,253 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:21,254 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:21,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash -603146269, now seen corresponding path program 4 times [2018-11-14 17:32:21,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:21,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:21,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:21,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2018-11-14 17:32:21,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {780#true} is VALID [2018-11-14 17:32:21,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2018-11-14 17:32:21,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #36#return; {780#true} is VALID [2018-11-14 17:32:21,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret4 := main(); {780#true} is VALID [2018-11-14 17:32:21,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {782#(= main_~i~0 0)} is VALID [2018-11-14 17:32:21,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#(= main_~i~0 0)} assume true; {782#(= main_~i~0 0)} is VALID [2018-11-14 17:32:21,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {782#(= main_~i~0 0)} is VALID [2018-11-14 17:32:21,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {782#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {783#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:21,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(<= main_~i~0 1)} assume true; {783#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:21,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {783#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {783#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:21,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {783#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {784#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:21,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {784#(<= main_~i~0 2)} assume true; {784#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:21,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {784#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {784#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:21,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {784#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {785#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:21,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {785#(<= main_~i~0 3)} assume true; {785#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:21,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {785#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {785#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:21,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {786#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:21,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {786#(<= main_~i~0 4)} assume true; {786#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:21,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {786#(<= main_~i~0 4)} assume !(~i~0 < 2048); {781#false} is VALID [2018-11-14 17:32:21,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {781#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {781#false} is VALID [2018-11-14 17:32:21,393 INFO L256 TraceCheckUtils]: 21: Hoare triple {781#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {781#false} is VALID [2018-11-14 17:32:21,394 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2018-11-14 17:32:21,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {781#false} assume ~cond == 0; {781#false} is VALID [2018-11-14 17:32:21,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {781#false} assume !false; {781#false} is VALID [2018-11-14 17:32:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:21,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:21,396 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-14 17:32:21,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:32:21,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:32:21,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:21,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:21,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2018-11-14 17:32:21,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {780#true} is VALID [2018-11-14 17:32:21,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2018-11-14 17:32:21,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #36#return; {780#true} is VALID [2018-11-14 17:32:21,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret4 := main(); {780#true} is VALID [2018-11-14 17:32:21,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {805#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:21,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#(<= main_~i~0 0)} assume true; {805#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:21,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {805#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:21,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {783#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:21,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(<= main_~i~0 1)} assume true; {783#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:21,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {783#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {783#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:21,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {783#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {784#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:21,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {784#(<= main_~i~0 2)} assume true; {784#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:21,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {784#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {784#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:21,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {784#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {785#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:21,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {785#(<= main_~i~0 3)} assume true; {785#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:21,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {785#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {785#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:21,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {786#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:21,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {786#(<= main_~i~0 4)} assume true; {786#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:21,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {786#(<= main_~i~0 4)} assume !(~i~0 < 2048); {781#false} is VALID [2018-11-14 17:32:21,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {781#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {781#false} is VALID [2018-11-14 17:32:21,610 INFO L256 TraceCheckUtils]: 21: Hoare triple {781#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {781#false} is VALID [2018-11-14 17:32:21,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2018-11-14 17:32:21,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {781#false} assume ~cond == 0; {781#false} is VALID [2018-11-14 17:32:21,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {781#false} assume !false; {781#false} is VALID [2018-11-14 17:32:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:21,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:32:21,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 17:32:21,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:21,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:32:21,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:21,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:32:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:32:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:32:21,677 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 8 states. [2018-11-14 17:32:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:21,834 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:32:21,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:32:21,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 17:32:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:32:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-14 17:32:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:32:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-14 17:32:21,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2018-11-14 17:32:21,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:21,889 INFO L225 Difference]: With dead ends: 36 [2018-11-14 17:32:21,889 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:32:21,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:32:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:32:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-14 17:32:21,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:21,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-14 17:32:21,907 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-14 17:32:21,907 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-14 17:32:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:21,908 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:32:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:32:21,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:21,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:21,909 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-14 17:32:21,910 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-14 17:32:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:21,911 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:32:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:32:21,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:21,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:21,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:21,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:32:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-14 17:32:21,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-11-14 17:32:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:21,915 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-14 17:32:21,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:32:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:32:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:32:21,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:21,916 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:21,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:21,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1388548262, now seen corresponding path program 5 times [2018-11-14 17:32:21,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:21,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:21,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:21,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:21,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:22,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {1013#true} call ULTIMATE.init(); {1013#true} is VALID [2018-11-14 17:32:22,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {1013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1013#true} is VALID [2018-11-14 17:32:22,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {1013#true} assume true; {1013#true} is VALID [2018-11-14 17:32:22,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1013#true} {1013#true} #36#return; {1013#true} is VALID [2018-11-14 17:32:22,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {1013#true} call #t~ret4 := main(); {1013#true} is VALID [2018-11-14 17:32:22,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {1013#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1015#(= main_~i~0 0)} is VALID [2018-11-14 17:32:22,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {1015#(= main_~i~0 0)} assume true; {1015#(= main_~i~0 0)} is VALID [2018-11-14 17:32:22,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {1015#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1015#(= main_~i~0 0)} is VALID [2018-11-14 17:32:22,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {1015#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1016#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {1016#(<= main_~i~0 1)} assume true; {1016#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {1016#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1016#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {1016#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {1017#(<= main_~i~0 2)} assume true; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {1017#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1017#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {1017#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {1018#(<= main_~i~0 3)} assume true; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {1018#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1018#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {1018#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#(<= main_~i~0 4)} assume true; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {1019#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1019#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {1019#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {1020#(<= main_~i~0 5)} assume true; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {1020#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1014#false} is VALID [2018-11-14 17:32:22,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {1014#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1014#false} is VALID [2018-11-14 17:32:22,138 INFO L256 TraceCheckUtils]: 24: Hoare triple {1014#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1014#false} is VALID [2018-11-14 17:32:22,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {1014#false} ~cond := #in~cond; {1014#false} is VALID [2018-11-14 17:32:22,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {1014#false} assume ~cond == 0; {1014#false} is VALID [2018-11-14 17:32:22,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {1014#false} assume !false; {1014#false} is VALID [2018-11-14 17:32:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:22,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:22,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:22,149 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:32:22,189 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:32:22,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:22,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:22,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {1013#true} call ULTIMATE.init(); {1013#true} is VALID [2018-11-14 17:32:22,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {1013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1013#true} is VALID [2018-11-14 17:32:22,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {1013#true} assume true; {1013#true} is VALID [2018-11-14 17:32:22,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1013#true} {1013#true} #36#return; {1013#true} is VALID [2018-11-14 17:32:22,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {1013#true} call #t~ret4 := main(); {1013#true} is VALID [2018-11-14 17:32:22,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {1013#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1039#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:22,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {1039#(<= main_~i~0 0)} assume true; {1039#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:22,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {1039#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1039#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:22,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {1039#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1016#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {1016#(<= main_~i~0 1)} assume true; {1016#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {1016#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1016#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {1016#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {1017#(<= main_~i~0 2)} assume true; {1017#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {1017#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1017#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {1017#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {1018#(<= main_~i~0 3)} assume true; {1018#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {1018#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1018#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {1018#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#(<= main_~i~0 4)} assume true; {1019#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {1019#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1019#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {1019#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {1020#(<= main_~i~0 5)} assume true; {1020#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {1020#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1014#false} is VALID [2018-11-14 17:32:22,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {1014#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1014#false} is VALID [2018-11-14 17:32:22,309 INFO L256 TraceCheckUtils]: 24: Hoare triple {1014#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1014#false} is VALID [2018-11-14 17:32:22,309 INFO L273 TraceCheckUtils]: 25: Hoare triple {1014#false} ~cond := #in~cond; {1014#false} is VALID [2018-11-14 17:32:22,309 INFO L273 TraceCheckUtils]: 26: Hoare triple {1014#false} assume ~cond == 0; {1014#false} is VALID [2018-11-14 17:32:22,310 INFO L273 TraceCheckUtils]: 27: Hoare triple {1014#false} assume !false; {1014#false} is VALID [2018-11-14 17:32:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:22,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:22,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:32:22,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-14 17:32:22,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:22,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:32:22,403 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-14 17:32:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:32:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:32:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:32:22,404 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2018-11-14 17:32:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:22,578 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:32:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:32:22,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-14 17:32:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:32:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-14 17:32:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:32:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-14 17:32:22,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2018-11-14 17:32:22,660 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-14 17:32:22,661 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:32:22,661 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:32:22,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:32:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:32:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-14 17:32:22,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:22,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-14 17:32:22,689 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-14 17:32:22,689 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-14 17:32:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:22,691 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:32:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:32:22,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:22,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:22,692 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-14 17:32:22,692 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-14 17:32:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:22,694 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:32:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:32:22,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:22,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:22,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:22,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:32:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-14 17:32:22,697 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-11-14 17:32:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:22,697 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-14 17:32:22,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:32:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:32:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:32:22,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:22,698 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:22,699 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:22,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash -317493117, now seen corresponding path program 6 times [2018-11-14 17:32:22,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:22,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:22,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:22,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:22,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2018-11-14 17:32:22,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {1270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1270#true} is VALID [2018-11-14 17:32:22,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2018-11-14 17:32:22,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #36#return; {1270#true} is VALID [2018-11-14 17:32:22,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret4 := main(); {1270#true} is VALID [2018-11-14 17:32:22,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {1270#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1272#(= main_~i~0 0)} is VALID [2018-11-14 17:32:22,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {1272#(= main_~i~0 0)} assume true; {1272#(= main_~i~0 0)} is VALID [2018-11-14 17:32:22,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {1272#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1272#(= main_~i~0 0)} is VALID [2018-11-14 17:32:22,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {1272#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1273#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {1273#(<= main_~i~0 1)} assume true; {1273#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {1273#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1273#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:22,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {1273#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1274#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {1274#(<= main_~i~0 2)} assume true; {1274#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {1274#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1274#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:22,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {1274#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1275#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {1275#(<= main_~i~0 3)} assume true; {1275#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {1275#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1275#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:22,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {1275#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1276#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {1276#(<= main_~i~0 4)} assume true; {1276#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {1276#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1276#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:22,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {1276#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1277#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#(<= main_~i~0 5)} assume true; {1277#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1277#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:22,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {1277#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1278#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:22,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#(<= main_~i~0 6)} assume true; {1278#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:22,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {1278#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1271#false} is VALID [2018-11-14 17:32:22,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {1271#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1271#false} is VALID [2018-11-14 17:32:22,893 INFO L256 TraceCheckUtils]: 27: Hoare triple {1271#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1271#false} is VALID [2018-11-14 17:32:22,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {1271#false} ~cond := #in~cond; {1271#false} is VALID [2018-11-14 17:32:22,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {1271#false} assume ~cond == 0; {1271#false} is VALID [2018-11-14 17:32:22,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2018-11-14 17:32:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:22,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:22,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:22,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:32:22,956 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:32:22,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:22,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:23,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2018-11-14 17:32:23,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {1270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1270#true} is VALID [2018-11-14 17:32:23,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2018-11-14 17:32:23,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #36#return; {1270#true} is VALID [2018-11-14 17:32:23,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret4 := main(); {1270#true} is VALID [2018-11-14 17:32:23,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {1270#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1297#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:23,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(<= main_~i~0 0)} assume true; {1297#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:23,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1297#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1297#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:23,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {1297#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1273#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:23,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {1273#(<= main_~i~0 1)} assume true; {1273#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:23,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1273#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1273#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:23,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1273#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1274#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:23,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1274#(<= main_~i~0 2)} assume true; {1274#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:23,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {1274#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1274#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:23,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {1274#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1275#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:23,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {1275#(<= main_~i~0 3)} assume true; {1275#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:23,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {1275#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1275#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:23,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {1275#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1276#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:23,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {1276#(<= main_~i~0 4)} assume true; {1276#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:23,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {1276#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1276#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:23,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {1276#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1277#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:23,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#(<= main_~i~0 5)} assume true; {1277#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:23,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1277#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:23,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {1277#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1278#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:23,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#(<= main_~i~0 6)} assume true; {1278#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:23,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1278#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1271#false} is VALID [2018-11-14 17:32:23,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {1271#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1271#false} is VALID [2018-11-14 17:32:23,271 INFO L256 TraceCheckUtils]: 27: Hoare triple {1271#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1271#false} is VALID [2018-11-14 17:32:23,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {1271#false} ~cond := #in~cond; {1271#false} is VALID [2018-11-14 17:32:23,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {1271#false} assume ~cond == 0; {1271#false} is VALID [2018-11-14 17:32:23,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2018-11-14 17:32:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:23,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:23,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 17:32:23,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-14 17:32:23,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:23,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:32:23,334 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-14 17:32:23,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:32:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:32:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:32:23,336 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2018-11-14 17:32:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:23,492 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:32:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:32:23,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-14 17:32:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:32:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-14 17:32:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:32:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-14 17:32:23,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2018-11-14 17:32:23,559 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-14 17:32:23,560 INFO L225 Difference]: With dead ends: 42 [2018-11-14 17:32:23,564 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:32:23,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:32:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:32:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 17:32:23,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:23,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 17:32:23,643 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 17:32:23,644 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 17:32:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:23,648 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:32:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:32:23,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:23,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:23,649 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 17:32:23,649 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 17:32:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:23,651 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:32:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:32:23,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:23,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:23,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:23,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:32:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-14 17:32:23,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-11-14 17:32:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:23,654 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-14 17:32:23,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:32:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:32:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:32:23,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:23,655 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:23,655 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:23,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 174289594, now seen corresponding path program 7 times [2018-11-14 17:32:23,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:23,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:24,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {1551#true} call ULTIMATE.init(); {1551#true} is VALID [2018-11-14 17:32:24,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {1551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1551#true} is VALID [2018-11-14 17:32:24,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {1551#true} assume true; {1551#true} is VALID [2018-11-14 17:32:24,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} #36#return; {1551#true} is VALID [2018-11-14 17:32:24,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {1551#true} call #t~ret4 := main(); {1551#true} is VALID [2018-11-14 17:32:24,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {1551#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1553#(= main_~i~0 0)} is VALID [2018-11-14 17:32:24,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {1553#(= main_~i~0 0)} assume true; {1553#(= main_~i~0 0)} is VALID [2018-11-14 17:32:24,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {1553#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1553#(= main_~i~0 0)} is VALID [2018-11-14 17:32:24,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {1553#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1554#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:24,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {1554#(<= main_~i~0 1)} assume true; {1554#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:24,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {1554#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1554#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:24,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {1554#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1555#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:24,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {1555#(<= main_~i~0 2)} assume true; {1555#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:24,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {1555#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1555#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:24,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {1555#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1556#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:24,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {1556#(<= main_~i~0 3)} assume true; {1556#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:24,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {1556#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1556#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:24,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {1556#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1557#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:24,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#(<= main_~i~0 4)} assume true; {1557#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:24,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1557#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:24,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1558#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:24,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {1558#(<= main_~i~0 5)} assume true; {1558#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:24,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {1558#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1558#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:24,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {1558#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1559#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:24,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {1559#(<= main_~i~0 6)} assume true; {1559#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:24,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {1559#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1559#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:24,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {1559#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1560#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:24,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {1560#(<= main_~i~0 7)} assume true; {1560#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:24,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {1560#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1552#false} is VALID [2018-11-14 17:32:24,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {1552#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1552#false} is VALID [2018-11-14 17:32:24,295 INFO L256 TraceCheckUtils]: 30: Hoare triple {1552#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1552#false} is VALID [2018-11-14 17:32:24,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {1552#false} ~cond := #in~cond; {1552#false} is VALID [2018-11-14 17:32:24,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {1552#false} assume ~cond == 0; {1552#false} is VALID [2018-11-14 17:32:24,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2018-11-14 17:32:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:24,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:24,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:24,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:24,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:24,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {1551#true} call ULTIMATE.init(); {1551#true} is VALID [2018-11-14 17:32:24,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {1551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1551#true} is VALID [2018-11-14 17:32:24,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {1551#true} assume true; {1551#true} is VALID [2018-11-14 17:32:24,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} #36#return; {1551#true} is VALID [2018-11-14 17:32:24,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {1551#true} call #t~ret4 := main(); {1551#true} is VALID [2018-11-14 17:32:24,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {1551#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1579#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:24,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {1579#(<= main_~i~0 0)} assume true; {1579#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:24,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {1579#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1579#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:24,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {1579#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1554#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:24,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {1554#(<= main_~i~0 1)} assume true; {1554#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:24,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {1554#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1554#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:24,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {1554#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1555#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:24,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {1555#(<= main_~i~0 2)} assume true; {1555#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:24,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {1555#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1555#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:24,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {1555#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1556#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:24,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {1556#(<= main_~i~0 3)} assume true; {1556#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:24,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {1556#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1556#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:24,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {1556#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1557#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:24,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#(<= main_~i~0 4)} assume true; {1557#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:24,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1557#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:24,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1558#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:24,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {1558#(<= main_~i~0 5)} assume true; {1558#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:24,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {1558#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1558#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:24,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {1558#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1559#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:24,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {1559#(<= main_~i~0 6)} assume true; {1559#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:24,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {1559#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1559#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:24,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {1559#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1560#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:24,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {1560#(<= main_~i~0 7)} assume true; {1560#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:24,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {1560#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1552#false} is VALID [2018-11-14 17:32:24,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {1552#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1552#false} is VALID [2018-11-14 17:32:24,537 INFO L256 TraceCheckUtils]: 30: Hoare triple {1552#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1552#false} is VALID [2018-11-14 17:32:24,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {1552#false} ~cond := #in~cond; {1552#false} is VALID [2018-11-14 17:32:24,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {1552#false} assume ~cond == 0; {1552#false} is VALID [2018-11-14 17:32:24,538 INFO L273 TraceCheckUtils]: 33: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2018-11-14 17:32:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:24,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:32:24,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-14 17:32:24,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:24,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:32:24,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:24,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:32:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:32:24,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:32:24,639 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 11 states. [2018-11-14 17:32:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:25,051 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:32:25,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:32:25,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-14 17:32:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:32:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-14 17:32:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:32:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-14 17:32:25,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2018-11-14 17:32:25,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:25,124 INFO L225 Difference]: With dead ends: 45 [2018-11-14 17:32:25,124 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:32:25,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:32:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:32:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:32:25,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:25,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:32:25,219 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:32:25,219 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:32:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:25,221 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:32:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:32:25,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:25,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:25,221 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:32:25,221 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:32:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:25,223 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:32:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:32:25,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:25,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:25,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:25,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:32:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-14 17:32:25,224 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-11-14 17:32:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:25,225 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-14 17:32:25,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:32:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:32:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:32:25,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:25,226 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:25,226 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:25,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash 739586339, now seen corresponding path program 8 times [2018-11-14 17:32:25,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:25,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:25,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2018-11-14 17:32:25,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1856#true} is VALID [2018-11-14 17:32:25,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2018-11-14 17:32:25,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #36#return; {1856#true} is VALID [2018-11-14 17:32:25,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret4 := main(); {1856#true} is VALID [2018-11-14 17:32:25,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {1856#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1858#(= main_~i~0 0)} is VALID [2018-11-14 17:32:25,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {1858#(= main_~i~0 0)} assume true; {1858#(= main_~i~0 0)} is VALID [2018-11-14 17:32:25,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {1858#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1858#(= main_~i~0 0)} is VALID [2018-11-14 17:32:25,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {1858#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1859#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:25,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~i~0 1)} assume true; {1859#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:25,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {1859#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1859#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:25,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {1859#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1860#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:25,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {1860#(<= main_~i~0 2)} assume true; {1860#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:25,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {1860#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1860#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:25,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {1860#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1861#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:25,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {1861#(<= main_~i~0 3)} assume true; {1861#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:25,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {1861#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1861#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:25,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {1861#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1862#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:25,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {1862#(<= main_~i~0 4)} assume true; {1862#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:25,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {1862#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1862#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:25,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {1862#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1863#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:25,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {1863#(<= main_~i~0 5)} assume true; {1863#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:25,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {1863#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1863#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:25,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {1863#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1864#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:25,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {1864#(<= main_~i~0 6)} assume true; {1864#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:25,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {1864#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1864#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:25,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {1864#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1865#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:25,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {1865#(<= main_~i~0 7)} assume true; {1865#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:25,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {1865#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1865#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:25,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {1865#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1866#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:25,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {1866#(<= main_~i~0 8)} assume true; {1866#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:25,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {1866#(<= main_~i~0 8)} assume !(~i~0 < 2048); {1857#false} is VALID [2018-11-14 17:32:25,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {1857#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1857#false} is VALID [2018-11-14 17:32:25,495 INFO L256 TraceCheckUtils]: 33: Hoare triple {1857#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1857#false} is VALID [2018-11-14 17:32:25,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2018-11-14 17:32:25,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {1857#false} assume ~cond == 0; {1857#false} is VALID [2018-11-14 17:32:25,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2018-11-14 17:32:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:25,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:25,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:25,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:25,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:25,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:25,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:25,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2018-11-14 17:32:25,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1856#true} is VALID [2018-11-14 17:32:25,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2018-11-14 17:32:25,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #36#return; {1856#true} is VALID [2018-11-14 17:32:25,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret4 := main(); {1856#true} is VALID [2018-11-14 17:32:25,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {1856#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1885#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:25,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {1885#(<= main_~i~0 0)} assume true; {1885#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:25,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {1885#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1885#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:25,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {1885#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1859#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:25,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~i~0 1)} assume true; {1859#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:25,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {1859#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1859#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:25,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {1859#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1860#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:25,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {1860#(<= main_~i~0 2)} assume true; {1860#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:25,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {1860#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1860#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:25,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {1860#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1861#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:25,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {1861#(<= main_~i~0 3)} assume true; {1861#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:25,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {1861#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1861#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:25,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {1861#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1862#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:25,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {1862#(<= main_~i~0 4)} assume true; {1862#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:25,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {1862#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1862#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:25,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {1862#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1863#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:25,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {1863#(<= main_~i~0 5)} assume true; {1863#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:25,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {1863#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1863#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:25,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {1863#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1864#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:25,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {1864#(<= main_~i~0 6)} assume true; {1864#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:25,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {1864#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1864#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:25,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {1864#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1865#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:25,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {1865#(<= main_~i~0 7)} assume true; {1865#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:25,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {1865#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1865#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:25,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {1865#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1866#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:25,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {1866#(<= main_~i~0 8)} assume true; {1866#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:25,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {1866#(<= main_~i~0 8)} assume !(~i~0 < 2048); {1857#false} is VALID [2018-11-14 17:32:25,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {1857#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {1857#false} is VALID [2018-11-14 17:32:25,712 INFO L256 TraceCheckUtils]: 33: Hoare triple {1857#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1857#false} is VALID [2018-11-14 17:32:25,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2018-11-14 17:32:25,712 INFO L273 TraceCheckUtils]: 35: Hoare triple {1857#false} assume ~cond == 0; {1857#false} is VALID [2018-11-14 17:32:25,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2018-11-14 17:32:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:25,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:25,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:32:25,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-14 17:32:25,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:25,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:32:25,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:25,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:32:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:32:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:32:25,801 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 12 states. [2018-11-14 17:32:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:26,045 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 17:32:26,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:32:26,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-14 17:32:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:32:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-11-14 17:32:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:32:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-11-14 17:32:26,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 48 transitions. [2018-11-14 17:32:26,110 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-14 17:32:26,112 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:32:26,112 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:32:26,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:32:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:32:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 17:32:26,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:26,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 17:32:26,140 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 17:32:26,141 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 17:32:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:26,142 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:32:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:32:26,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:26,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:26,142 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 17:32:26,143 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 17:32:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:26,144 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:32:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:32:26,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:26,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:26,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:26,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:32:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-14 17:32:26,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-11-14 17:32:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:26,146 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-14 17:32:26,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:32:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:32:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:32:26,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:26,147 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:26,147 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:26,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 928149018, now seen corresponding path program 9 times [2018-11-14 17:32:26,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:26,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:26,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:26,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {2185#true} call ULTIMATE.init(); {2185#true} is VALID [2018-11-14 17:32:26,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {2185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2185#true} is VALID [2018-11-14 17:32:26,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {2185#true} assume true; {2185#true} is VALID [2018-11-14 17:32:26,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} #36#return; {2185#true} is VALID [2018-11-14 17:32:26,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {2185#true} call #t~ret4 := main(); {2185#true} is VALID [2018-11-14 17:32:26,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {2185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2187#(= main_~i~0 0)} is VALID [2018-11-14 17:32:26,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {2187#(= main_~i~0 0)} assume true; {2187#(= main_~i~0 0)} is VALID [2018-11-14 17:32:26,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {2187#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2187#(= main_~i~0 0)} is VALID [2018-11-14 17:32:26,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {2187#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2188#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:26,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {2188#(<= main_~i~0 1)} assume true; {2188#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:26,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {2188#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2188#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:26,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {2188#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2189#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:26,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {2189#(<= main_~i~0 2)} assume true; {2189#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:26,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {2189#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2189#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:26,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {2189#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2190#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:26,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {2190#(<= main_~i~0 3)} assume true; {2190#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:26,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {2190#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2190#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:26,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {2190#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2191#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:26,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {2191#(<= main_~i~0 4)} assume true; {2191#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:26,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {2191#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2191#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:26,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {2191#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2192#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:26,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {2192#(<= main_~i~0 5)} assume true; {2192#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:26,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {2192#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2192#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:26,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {2192#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2193#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:26,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {2193#(<= main_~i~0 6)} assume true; {2193#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:26,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {2193#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2193#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:26,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {2193#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2194#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:26,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {2194#(<= main_~i~0 7)} assume true; {2194#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:26,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {2194#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2194#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:26,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {2194#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2195#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:26,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {2195#(<= main_~i~0 8)} assume true; {2195#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:26,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {2195#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2195#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:26,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {2195#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2196#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:26,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {2196#(<= main_~i~0 9)} assume true; {2196#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:26,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {2196#(<= main_~i~0 9)} assume !(~i~0 < 2048); {2186#false} is VALID [2018-11-14 17:32:26,594 INFO L273 TraceCheckUtils]: 35: Hoare triple {2186#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {2186#false} is VALID [2018-11-14 17:32:26,595 INFO L256 TraceCheckUtils]: 36: Hoare triple {2186#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2186#false} is VALID [2018-11-14 17:32:26,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {2186#false} ~cond := #in~cond; {2186#false} is VALID [2018-11-14 17:32:26,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {2186#false} assume ~cond == 0; {2186#false} is VALID [2018-11-14 17:32:26,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {2186#false} assume !false; {2186#false} is VALID [2018-11-14 17:32:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:26,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:26,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:26,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:32:26,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 17:32:26,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:26,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:26,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {2185#true} call ULTIMATE.init(); {2185#true} is VALID [2018-11-14 17:32:26,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {2185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2185#true} is VALID [2018-11-14 17:32:26,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {2185#true} assume true; {2185#true} is VALID [2018-11-14 17:32:26,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} #36#return; {2185#true} is VALID [2018-11-14 17:32:26,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {2185#true} call #t~ret4 := main(); {2185#true} is VALID [2018-11-14 17:32:26,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {2185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2215#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:26,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {2215#(<= main_~i~0 0)} assume true; {2215#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:26,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {2215#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2215#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:26,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {2215#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2188#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:26,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {2188#(<= main_~i~0 1)} assume true; {2188#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:26,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {2188#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2188#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:26,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {2188#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2189#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:26,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {2189#(<= main_~i~0 2)} assume true; {2189#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:26,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {2189#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2189#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:26,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {2189#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2190#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:26,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {2190#(<= main_~i~0 3)} assume true; {2190#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:26,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {2190#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2190#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:26,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {2190#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2191#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:26,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {2191#(<= main_~i~0 4)} assume true; {2191#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:26,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {2191#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2191#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:26,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {2191#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2192#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:26,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {2192#(<= main_~i~0 5)} assume true; {2192#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:26,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {2192#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2192#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:26,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {2192#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2193#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:26,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {2193#(<= main_~i~0 6)} assume true; {2193#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:26,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {2193#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2193#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:26,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {2193#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2194#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:26,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {2194#(<= main_~i~0 7)} assume true; {2194#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:26,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {2194#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2194#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:26,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {2194#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2195#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:26,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {2195#(<= main_~i~0 8)} assume true; {2195#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:26,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {2195#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2195#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:26,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {2195#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2196#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:26,825 INFO L273 TraceCheckUtils]: 33: Hoare triple {2196#(<= main_~i~0 9)} assume true; {2196#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:26,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {2196#(<= main_~i~0 9)} assume !(~i~0 < 2048); {2186#false} is VALID [2018-11-14 17:32:26,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {2186#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {2186#false} is VALID [2018-11-14 17:32:26,826 INFO L256 TraceCheckUtils]: 36: Hoare triple {2186#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2186#false} is VALID [2018-11-14 17:32:26,826 INFO L273 TraceCheckUtils]: 37: Hoare triple {2186#false} ~cond := #in~cond; {2186#false} is VALID [2018-11-14 17:32:26,826 INFO L273 TraceCheckUtils]: 38: Hoare triple {2186#false} assume ~cond == 0; {2186#false} is VALID [2018-11-14 17:32:26,826 INFO L273 TraceCheckUtils]: 39: Hoare triple {2186#false} assume !false; {2186#false} is VALID [2018-11-14 17:32:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 17:32:26,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-14 17:32:26,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:26,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:32:26,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:26,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:32:26,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:32:26,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:32:26,890 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2018-11-14 17:32:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:27,028 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-14 17:32:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:32:27,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-14 17:32:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:32:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-14 17:32:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:32:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-14 17:32:27,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2018-11-14 17:32:27,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:27,093 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:32:27,094 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:32:27,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:32:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:32:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-14 17:32:27,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:27,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-14 17:32:27,106 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-14 17:32:27,106 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-14 17:32:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:27,108 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:32:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:32:27,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:27,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:27,109 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-14 17:32:27,109 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-14 17:32:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:27,110 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:32:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:32:27,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:27,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:27,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:27,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:32:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-14 17:32:27,111 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-11-14 17:32:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:27,112 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-14 17:32:27,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:32:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:32:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:32:27,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:27,113 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:27,113 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:27,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 581695939, now seen corresponding path program 10 times [2018-11-14 17:32:27,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:27,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:27,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:27,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:27,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2018-11-14 17:32:27,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {2538#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2538#true} is VALID [2018-11-14 17:32:27,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2018-11-14 17:32:27,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #36#return; {2538#true} is VALID [2018-11-14 17:32:27,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret4 := main(); {2538#true} is VALID [2018-11-14 17:32:27,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {2538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2540#(= main_~i~0 0)} is VALID [2018-11-14 17:32:27,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {2540#(= main_~i~0 0)} assume true; {2540#(= main_~i~0 0)} is VALID [2018-11-14 17:32:27,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {2540#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2540#(= main_~i~0 0)} is VALID [2018-11-14 17:32:27,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {2540#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2541#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:27,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {2541#(<= main_~i~0 1)} assume true; {2541#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:27,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {2541#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2541#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:27,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {2541#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2542#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:27,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {2542#(<= main_~i~0 2)} assume true; {2542#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:27,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2542#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2542#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:27,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {2542#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2543#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:27,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {2543#(<= main_~i~0 3)} assume true; {2543#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:27,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {2543#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2543#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:27,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {2543#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2544#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:27,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {2544#(<= main_~i~0 4)} assume true; {2544#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:27,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2544#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:27,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2545#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:27,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {2545#(<= main_~i~0 5)} assume true; {2545#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:27,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {2545#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2545#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:27,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {2545#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2546#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:27,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {2546#(<= main_~i~0 6)} assume true; {2546#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:27,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {2546#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2546#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:27,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {2546#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2547#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:27,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#(<= main_~i~0 7)} assume true; {2547#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:27,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {2547#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2547#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:27,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2548#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:27,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {2548#(<= main_~i~0 8)} assume true; {2548#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:27,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {2548#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2548#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:27,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {2548#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2549#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:27,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {2549#(<= main_~i~0 9)} assume true; {2549#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:27,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {2549#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2549#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:27,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {2549#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2550#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:27,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {2550#(<= main_~i~0 10)} assume true; {2550#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:27,419 INFO L273 TraceCheckUtils]: 37: Hoare triple {2550#(<= main_~i~0 10)} assume !(~i~0 < 2048); {2539#false} is VALID [2018-11-14 17:32:27,419 INFO L273 TraceCheckUtils]: 38: Hoare triple {2539#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {2539#false} is VALID [2018-11-14 17:32:27,419 INFO L256 TraceCheckUtils]: 39: Hoare triple {2539#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2539#false} is VALID [2018-11-14 17:32:27,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {2539#false} ~cond := #in~cond; {2539#false} is VALID [2018-11-14 17:32:27,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {2539#false} assume ~cond == 0; {2539#false} is VALID [2018-11-14 17:32:27,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2018-11-14 17:32:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:27,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:27,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:27,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:32:27,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:32:27,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:27,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:27,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2018-11-14 17:32:27,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {2538#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2538#true} is VALID [2018-11-14 17:32:27,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2018-11-14 17:32:27,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #36#return; {2538#true} is VALID [2018-11-14 17:32:27,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret4 := main(); {2538#true} is VALID [2018-11-14 17:32:27,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {2538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2569#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:27,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {2569#(<= main_~i~0 0)} assume true; {2569#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:27,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {2569#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2569#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:27,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2541#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:27,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {2541#(<= main_~i~0 1)} assume true; {2541#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:27,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {2541#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2541#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:27,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {2541#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2542#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:27,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {2542#(<= main_~i~0 2)} assume true; {2542#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:27,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {2542#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2542#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:27,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {2542#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2543#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:27,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {2543#(<= main_~i~0 3)} assume true; {2543#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:27,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {2543#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2543#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:27,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {2543#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2544#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:27,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {2544#(<= main_~i~0 4)} assume true; {2544#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:27,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2544#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:27,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2545#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:27,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {2545#(<= main_~i~0 5)} assume true; {2545#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:27,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {2545#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2545#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:27,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {2545#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2546#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:27,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {2546#(<= main_~i~0 6)} assume true; {2546#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:27,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {2546#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2546#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:27,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {2546#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2547#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:27,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#(<= main_~i~0 7)} assume true; {2547#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:27,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {2547#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2547#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:27,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2548#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:27,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {2548#(<= main_~i~0 8)} assume true; {2548#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:27,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {2548#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2548#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:27,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {2548#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2549#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:27,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {2549#(<= main_~i~0 9)} assume true; {2549#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:27,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {2549#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2549#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:27,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {2549#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2550#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:27,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {2550#(<= main_~i~0 10)} assume true; {2550#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:27,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {2550#(<= main_~i~0 10)} assume !(~i~0 < 2048); {2539#false} is VALID [2018-11-14 17:32:27,887 INFO L273 TraceCheckUtils]: 38: Hoare triple {2539#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {2539#false} is VALID [2018-11-14 17:32:27,887 INFO L256 TraceCheckUtils]: 39: Hoare triple {2539#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2539#false} is VALID [2018-11-14 17:32:27,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {2539#false} ~cond := #in~cond; {2539#false} is VALID [2018-11-14 17:32:27,887 INFO L273 TraceCheckUtils]: 41: Hoare triple {2539#false} assume ~cond == 0; {2539#false} is VALID [2018-11-14 17:32:27,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2018-11-14 17:32:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:27,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:27,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:32:27,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-14 17:32:27,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:27,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:32:27,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:27,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:32:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:32:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:32:27,959 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 14 states. [2018-11-14 17:32:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:28,196 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 17:32:28,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:32:28,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-14 17:32:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:32:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-14 17:32:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:32:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-14 17:32:28,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2018-11-14 17:32:28,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:28,252 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:32:28,253 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:32:28,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:32:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:32:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-14 17:32:28,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:28,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-14 17:32:28,267 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-14 17:32:28,267 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-14 17:32:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:28,268 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 17:32:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-14 17:32:28,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:28,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:28,269 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-14 17:32:28,269 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-14 17:32:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:28,270 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 17:32:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-14 17:32:28,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:28,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:28,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:28,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:32:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-14 17:32:28,272 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-11-14 17:32:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:28,272 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-14 17:32:28,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:32:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:32:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:32:28,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:28,273 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:28,273 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:28,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 204431738, now seen corresponding path program 11 times [2018-11-14 17:32:28,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:28,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:28,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {2915#true} call ULTIMATE.init(); {2915#true} is VALID [2018-11-14 17:32:28,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {2915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2915#true} is VALID [2018-11-14 17:32:28,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {2915#true} assume true; {2915#true} is VALID [2018-11-14 17:32:28,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2915#true} {2915#true} #36#return; {2915#true} is VALID [2018-11-14 17:32:28,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {2915#true} call #t~ret4 := main(); {2915#true} is VALID [2018-11-14 17:32:28,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {2915#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2917#(= main_~i~0 0)} is VALID [2018-11-14 17:32:28,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {2917#(= main_~i~0 0)} assume true; {2917#(= main_~i~0 0)} is VALID [2018-11-14 17:32:28,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {2917#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2917#(= main_~i~0 0)} is VALID [2018-11-14 17:32:28,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {2917#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2918#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:28,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {2918#(<= main_~i~0 1)} assume true; {2918#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:28,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {2918#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2918#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:28,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {2918#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2919#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:28,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {2919#(<= main_~i~0 2)} assume true; {2919#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:28,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {2919#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2919#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:28,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {2919#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2920#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:28,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {2920#(<= main_~i~0 3)} assume true; {2920#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:28,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {2920#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2920#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:28,477 INFO L273 TraceCheckUtils]: 17: Hoare triple {2920#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2921#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:28,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {2921#(<= main_~i~0 4)} assume true; {2921#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:28,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {2921#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2921#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:28,479 INFO L273 TraceCheckUtils]: 20: Hoare triple {2921#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2922#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:28,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {2922#(<= main_~i~0 5)} assume true; {2922#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:28,480 INFO L273 TraceCheckUtils]: 22: Hoare triple {2922#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2922#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:28,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {2922#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2923#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:28,482 INFO L273 TraceCheckUtils]: 24: Hoare triple {2923#(<= main_~i~0 6)} assume true; {2923#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:28,482 INFO L273 TraceCheckUtils]: 25: Hoare triple {2923#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2923#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:28,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {2923#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2924#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:28,484 INFO L273 TraceCheckUtils]: 27: Hoare triple {2924#(<= main_~i~0 7)} assume true; {2924#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:28,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {2924#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2924#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:28,485 INFO L273 TraceCheckUtils]: 29: Hoare triple {2924#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2925#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:28,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {2925#(<= main_~i~0 8)} assume true; {2925#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:28,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {2925#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2925#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:28,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {2925#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2926#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:28,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {2926#(<= main_~i~0 9)} assume true; {2926#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:28,488 INFO L273 TraceCheckUtils]: 34: Hoare triple {2926#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2926#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:28,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {2926#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2927#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:28,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {2927#(<= main_~i~0 10)} assume true; {2927#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:28,490 INFO L273 TraceCheckUtils]: 37: Hoare triple {2927#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2927#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:28,490 INFO L273 TraceCheckUtils]: 38: Hoare triple {2927#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2928#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:28,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {2928#(<= main_~i~0 11)} assume true; {2928#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:28,492 INFO L273 TraceCheckUtils]: 40: Hoare triple {2928#(<= main_~i~0 11)} assume !(~i~0 < 2048); {2916#false} is VALID [2018-11-14 17:32:28,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {2916#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {2916#false} is VALID [2018-11-14 17:32:28,492 INFO L256 TraceCheckUtils]: 42: Hoare triple {2916#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2916#false} is VALID [2018-11-14 17:32:28,492 INFO L273 TraceCheckUtils]: 43: Hoare triple {2916#false} ~cond := #in~cond; {2916#false} is VALID [2018-11-14 17:32:28,492 INFO L273 TraceCheckUtils]: 44: Hoare triple {2916#false} assume ~cond == 0; {2916#false} is VALID [2018-11-14 17:32:28,493 INFO L273 TraceCheckUtils]: 45: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2018-11-14 17:32:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:28,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:28,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:32:28,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 17:32:28,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:28,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:28,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {2915#true} call ULTIMATE.init(); {2915#true} is VALID [2018-11-14 17:32:28,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {2915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2915#true} is VALID [2018-11-14 17:32:28,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {2915#true} assume true; {2915#true} is VALID [2018-11-14 17:32:28,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2915#true} {2915#true} #36#return; {2915#true} is VALID [2018-11-14 17:32:28,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {2915#true} call #t~ret4 := main(); {2915#true} is VALID [2018-11-14 17:32:28,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {2915#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2947#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:28,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2947#(<= main_~i~0 0)} assume true; {2947#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:28,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {2947#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2947#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:28,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {2947#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2918#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:28,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {2918#(<= main_~i~0 1)} assume true; {2918#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:28,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {2918#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2918#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:28,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {2918#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2919#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:28,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {2919#(<= main_~i~0 2)} assume true; {2919#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:28,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {2919#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2919#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:28,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {2919#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2920#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:28,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {2920#(<= main_~i~0 3)} assume true; {2920#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:28,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {2920#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2920#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:28,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {2920#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2921#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:28,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {2921#(<= main_~i~0 4)} assume true; {2921#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:28,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {2921#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2921#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:28,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {2921#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2922#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:28,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {2922#(<= main_~i~0 5)} assume true; {2922#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:28,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {2922#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2922#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:28,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2922#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2923#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:28,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {2923#(<= main_~i~0 6)} assume true; {2923#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:28,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {2923#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2923#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:28,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {2923#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2924#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:28,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {2924#(<= main_~i~0 7)} assume true; {2924#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:28,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {2924#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2924#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:28,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {2924#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2925#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:28,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {2925#(<= main_~i~0 8)} assume true; {2925#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:28,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {2925#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2925#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:28,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {2925#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2926#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:28,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {2926#(<= main_~i~0 9)} assume true; {2926#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:28,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {2926#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2926#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:28,768 INFO L273 TraceCheckUtils]: 35: Hoare triple {2926#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2927#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:28,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {2927#(<= main_~i~0 10)} assume true; {2927#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:28,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {2927#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2927#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:28,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {2927#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2928#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:28,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {2928#(<= main_~i~0 11)} assume true; {2928#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:28,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {2928#(<= main_~i~0 11)} assume !(~i~0 < 2048); {2916#false} is VALID [2018-11-14 17:32:28,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {2916#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {2916#false} is VALID [2018-11-14 17:32:28,771 INFO L256 TraceCheckUtils]: 42: Hoare triple {2916#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2916#false} is VALID [2018-11-14 17:32:28,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {2916#false} ~cond := #in~cond; {2916#false} is VALID [2018-11-14 17:32:28,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {2916#false} assume ~cond == 0; {2916#false} is VALID [2018-11-14 17:32:28,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2018-11-14 17:32:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:28,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:28,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 17:32:28,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-14 17:32:28,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:28,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:32:28,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:28,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:32:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:32:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:32:28,843 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 15 states. [2018-11-14 17:32:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:29,082 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-14 17:32:29,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:32:29,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-14 17:32:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:32:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2018-11-14 17:32:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:32:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2018-11-14 17:32:29,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2018-11-14 17:32:29,148 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-14 17:32:29,150 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:32:29,150 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:32:29,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:32:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:32:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 17:32:29,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:29,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 17:32:29,174 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 17:32:29,175 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 17:32:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:29,176 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-14 17:32:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-14 17:32:29,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:29,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:29,178 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 17:32:29,178 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 17:32:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:29,179 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-14 17:32:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-14 17:32:29,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:29,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:29,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:29,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:32:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-14 17:32:29,181 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-11-14 17:32:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:29,181 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-14 17:32:29,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:32:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-14 17:32:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:32:29,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:29,182 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:29,182 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:29,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:29,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1056033379, now seen corresponding path program 12 times [2018-11-14 17:32:29,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:29,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:29,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:29,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {3316#true} call ULTIMATE.init(); {3316#true} is VALID [2018-11-14 17:32:29,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {3316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3316#true} is VALID [2018-11-14 17:32:29,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {3316#true} assume true; {3316#true} is VALID [2018-11-14 17:32:29,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3316#true} {3316#true} #36#return; {3316#true} is VALID [2018-11-14 17:32:29,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {3316#true} call #t~ret4 := main(); {3316#true} is VALID [2018-11-14 17:32:29,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {3316#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3318#(= main_~i~0 0)} is VALID [2018-11-14 17:32:29,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {3318#(= main_~i~0 0)} assume true; {3318#(= main_~i~0 0)} is VALID [2018-11-14 17:32:29,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {3318#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3318#(= main_~i~0 0)} is VALID [2018-11-14 17:32:29,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {3318#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3319#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:29,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {3319#(<= main_~i~0 1)} assume true; {3319#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:29,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {3319#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3319#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:29,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {3319#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3320#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:29,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {3320#(<= main_~i~0 2)} assume true; {3320#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:29,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {3320#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3320#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:29,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {3320#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3321#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:29,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {3321#(<= main_~i~0 3)} assume true; {3321#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:29,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {3321#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3321#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:29,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {3321#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3322#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:29,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {3322#(<= main_~i~0 4)} assume true; {3322#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:29,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {3322#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3322#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:29,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {3322#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3323#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:29,437 INFO L273 TraceCheckUtils]: 21: Hoare triple {3323#(<= main_~i~0 5)} assume true; {3323#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:29,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {3323#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3323#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:29,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {3323#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3324#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:29,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {3324#(<= main_~i~0 6)} assume true; {3324#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:29,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {3324#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3324#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:29,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {3324#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3325#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:29,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {3325#(<= main_~i~0 7)} assume true; {3325#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:29,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {3325#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3325#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:29,442 INFO L273 TraceCheckUtils]: 29: Hoare triple {3325#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3326#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:29,443 INFO L273 TraceCheckUtils]: 30: Hoare triple {3326#(<= main_~i~0 8)} assume true; {3326#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:29,443 INFO L273 TraceCheckUtils]: 31: Hoare triple {3326#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3326#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:29,444 INFO L273 TraceCheckUtils]: 32: Hoare triple {3326#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3327#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:29,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {3327#(<= main_~i~0 9)} assume true; {3327#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:29,445 INFO L273 TraceCheckUtils]: 34: Hoare triple {3327#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3327#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:29,446 INFO L273 TraceCheckUtils]: 35: Hoare triple {3327#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3328#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:29,446 INFO L273 TraceCheckUtils]: 36: Hoare triple {3328#(<= main_~i~0 10)} assume true; {3328#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:29,447 INFO L273 TraceCheckUtils]: 37: Hoare triple {3328#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3328#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:29,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {3328#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3329#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:29,448 INFO L273 TraceCheckUtils]: 39: Hoare triple {3329#(<= main_~i~0 11)} assume true; {3329#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:29,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {3329#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3329#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:29,449 INFO L273 TraceCheckUtils]: 41: Hoare triple {3329#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3330#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:29,450 INFO L273 TraceCheckUtils]: 42: Hoare triple {3330#(<= main_~i~0 12)} assume true; {3330#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:29,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {3330#(<= main_~i~0 12)} assume !(~i~0 < 2048); {3317#false} is VALID [2018-11-14 17:32:29,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {3317#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {3317#false} is VALID [2018-11-14 17:32:29,451 INFO L256 TraceCheckUtils]: 45: Hoare triple {3317#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3317#false} is VALID [2018-11-14 17:32:29,451 INFO L273 TraceCheckUtils]: 46: Hoare triple {3317#false} ~cond := #in~cond; {3317#false} is VALID [2018-11-14 17:32:29,452 INFO L273 TraceCheckUtils]: 47: Hoare triple {3317#false} assume ~cond == 0; {3317#false} is VALID [2018-11-14 17:32:29,452 INFO L273 TraceCheckUtils]: 48: Hoare triple {3317#false} assume !false; {3317#false} is VALID [2018-11-14 17:32:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:29,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:29,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:29,463 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:32:29,574 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 17:32:29,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:29,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:29,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {3316#true} call ULTIMATE.init(); {3316#true} is VALID [2018-11-14 17:32:29,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {3316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3316#true} is VALID [2018-11-14 17:32:29,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {3316#true} assume true; {3316#true} is VALID [2018-11-14 17:32:29,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3316#true} {3316#true} #36#return; {3316#true} is VALID [2018-11-14 17:32:29,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {3316#true} call #t~ret4 := main(); {3316#true} is VALID [2018-11-14 17:32:29,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {3316#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3349#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:29,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {3349#(<= main_~i~0 0)} assume true; {3349#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:29,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {3349#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3349#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:29,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {3349#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3319#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:29,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {3319#(<= main_~i~0 1)} assume true; {3319#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:29,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {3319#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3319#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:29,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {3319#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3320#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:29,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {3320#(<= main_~i~0 2)} assume true; {3320#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:29,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {3320#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3320#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:29,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {3320#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3321#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:29,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {3321#(<= main_~i~0 3)} assume true; {3321#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:29,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {3321#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3321#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:29,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {3321#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3322#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:29,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {3322#(<= main_~i~0 4)} assume true; {3322#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:29,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {3322#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3322#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:29,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {3322#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3323#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:29,864 INFO L273 TraceCheckUtils]: 21: Hoare triple {3323#(<= main_~i~0 5)} assume true; {3323#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:29,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {3323#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3323#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:29,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {3323#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3324#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:29,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {3324#(<= main_~i~0 6)} assume true; {3324#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:29,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {3324#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3324#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:29,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {3324#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3325#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:29,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {3325#(<= main_~i~0 7)} assume true; {3325#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:29,958 INFO L273 TraceCheckUtils]: 28: Hoare triple {3325#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3325#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:29,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {3325#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3326#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:29,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {3326#(<= main_~i~0 8)} assume true; {3326#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:29,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {3326#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3326#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:29,972 INFO L273 TraceCheckUtils]: 32: Hoare triple {3326#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3327#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:29,972 INFO L273 TraceCheckUtils]: 33: Hoare triple {3327#(<= main_~i~0 9)} assume true; {3327#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:29,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {3327#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3327#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:29,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {3327#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3328#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:29,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {3328#(<= main_~i~0 10)} assume true; {3328#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:29,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {3328#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3328#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:29,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {3328#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3329#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:29,974 INFO L273 TraceCheckUtils]: 39: Hoare triple {3329#(<= main_~i~0 11)} assume true; {3329#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:29,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {3329#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3329#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:29,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {3329#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3330#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:29,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {3330#(<= main_~i~0 12)} assume true; {3330#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:29,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {3330#(<= main_~i~0 12)} assume !(~i~0 < 2048); {3317#false} is VALID [2018-11-14 17:32:29,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {3317#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {3317#false} is VALID [2018-11-14 17:32:29,977 INFO L256 TraceCheckUtils]: 45: Hoare triple {3317#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3317#false} is VALID [2018-11-14 17:32:29,977 INFO L273 TraceCheckUtils]: 46: Hoare triple {3317#false} ~cond := #in~cond; {3317#false} is VALID [2018-11-14 17:32:29,977 INFO L273 TraceCheckUtils]: 47: Hoare triple {3317#false} assume ~cond == 0; {3317#false} is VALID [2018-11-14 17:32:29,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {3317#false} assume !false; {3317#false} is VALID [2018-11-14 17:32:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:30,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 17:32:30,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-14 17:32:30,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:30,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:32:30,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:30,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:32:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:32:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:32:30,068 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 16 states. [2018-11-14 17:32:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:30,278 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 17:32:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 17:32:30,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-14 17:32:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:32:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-14 17:32:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:32:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-14 17:32:30,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2018-11-14 17:32:30,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:30,342 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:32:30,342 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:32:30,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:32:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:32:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-14 17:32:30,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:30,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-14 17:32:30,359 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-14 17:32:30,359 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-14 17:32:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:30,360 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 17:32:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 17:32:30,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:30,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:30,361 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-14 17:32:30,361 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-14 17:32:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:30,362 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 17:32:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 17:32:30,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:30,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:30,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:30,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:32:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-14 17:32:30,364 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-11-14 17:32:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:30,365 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-14 17:32:30,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:32:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-14 17:32:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:32:30,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:30,366 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:30,366 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:30,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash 748702938, now seen corresponding path program 13 times [2018-11-14 17:32:30,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:30,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:30,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:30,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:31,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {3741#true} call ULTIMATE.init(); {3741#true} is VALID [2018-11-14 17:32:31,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {3741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3741#true} is VALID [2018-11-14 17:32:31,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {3741#true} assume true; {3741#true} is VALID [2018-11-14 17:32:31,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3741#true} {3741#true} #36#return; {3741#true} is VALID [2018-11-14 17:32:31,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {3741#true} call #t~ret4 := main(); {3741#true} is VALID [2018-11-14 17:32:31,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {3741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3743#(= main_~i~0 0)} is VALID [2018-11-14 17:32:31,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {3743#(= main_~i~0 0)} assume true; {3743#(= main_~i~0 0)} is VALID [2018-11-14 17:32:31,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {3743#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3743#(= main_~i~0 0)} is VALID [2018-11-14 17:32:31,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {3743#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3744#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:31,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {3744#(<= main_~i~0 1)} assume true; {3744#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:31,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {3744#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3744#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:31,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {3744#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3745#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:31,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {3745#(<= main_~i~0 2)} assume true; {3745#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:31,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {3745#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3745#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:31,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {3745#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3746#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:31,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {3746#(<= main_~i~0 3)} assume true; {3746#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:31,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {3746#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3746#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:31,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {3746#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3747#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:31,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {3747#(<= main_~i~0 4)} assume true; {3747#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:31,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {3747#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3747#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:31,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {3747#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3748#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:31,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {3748#(<= main_~i~0 5)} assume true; {3748#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:31,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {3748#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3748#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:31,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {3748#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3749#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:31,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {3749#(<= main_~i~0 6)} assume true; {3749#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:31,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {3749#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3749#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:31,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {3749#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3750#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:31,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {3750#(<= main_~i~0 7)} assume true; {3750#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:31,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {3750#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3750#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:31,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {3750#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3751#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:31,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {3751#(<= main_~i~0 8)} assume true; {3751#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:31,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {3751#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3751#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:31,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {3751#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3752#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:31,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {3752#(<= main_~i~0 9)} assume true; {3752#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:31,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {3752#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3752#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:31,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {3752#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3753#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:31,159 INFO L273 TraceCheckUtils]: 36: Hoare triple {3753#(<= main_~i~0 10)} assume true; {3753#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:31,159 INFO L273 TraceCheckUtils]: 37: Hoare triple {3753#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3753#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:31,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {3753#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3754#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:31,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {3754#(<= main_~i~0 11)} assume true; {3754#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:31,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {3754#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3754#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:31,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {3754#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3755#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:31,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {3755#(<= main_~i~0 12)} assume true; {3755#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:31,164 INFO L273 TraceCheckUtils]: 43: Hoare triple {3755#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3755#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:31,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {3755#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3756#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:31,165 INFO L273 TraceCheckUtils]: 45: Hoare triple {3756#(<= main_~i~0 13)} assume true; {3756#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:31,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {3756#(<= main_~i~0 13)} assume !(~i~0 < 2048); {3742#false} is VALID [2018-11-14 17:32:31,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {3742#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {3742#false} is VALID [2018-11-14 17:32:31,166 INFO L256 TraceCheckUtils]: 48: Hoare triple {3742#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3742#false} is VALID [2018-11-14 17:32:31,167 INFO L273 TraceCheckUtils]: 49: Hoare triple {3742#false} ~cond := #in~cond; {3742#false} is VALID [2018-11-14 17:32:31,167 INFO L273 TraceCheckUtils]: 50: Hoare triple {3742#false} assume ~cond == 0; {3742#false} is VALID [2018-11-14 17:32:31,167 INFO L273 TraceCheckUtils]: 51: Hoare triple {3742#false} assume !false; {3742#false} is VALID [2018-11-14 17:32:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:31,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:31,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:31,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:31,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:31,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {3741#true} call ULTIMATE.init(); {3741#true} is VALID [2018-11-14 17:32:31,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {3741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3741#true} is VALID [2018-11-14 17:32:31,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {3741#true} assume true; {3741#true} is VALID [2018-11-14 17:32:31,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3741#true} {3741#true} #36#return; {3741#true} is VALID [2018-11-14 17:32:31,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {3741#true} call #t~ret4 := main(); {3741#true} is VALID [2018-11-14 17:32:31,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {3741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3775#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:31,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {3775#(<= main_~i~0 0)} assume true; {3775#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:31,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {3775#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3775#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:31,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {3775#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3744#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:31,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {3744#(<= main_~i~0 1)} assume true; {3744#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:31,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {3744#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3744#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:31,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {3744#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3745#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:31,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {3745#(<= main_~i~0 2)} assume true; {3745#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:31,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {3745#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3745#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:31,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {3745#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3746#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:31,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {3746#(<= main_~i~0 3)} assume true; {3746#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:31,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {3746#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3746#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:31,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {3746#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3747#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:31,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {3747#(<= main_~i~0 4)} assume true; {3747#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:31,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {3747#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3747#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:31,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {3747#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3748#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:31,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {3748#(<= main_~i~0 5)} assume true; {3748#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:31,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {3748#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3748#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:31,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {3748#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3749#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:31,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {3749#(<= main_~i~0 6)} assume true; {3749#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:31,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {3749#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3749#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:31,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {3749#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3750#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:31,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {3750#(<= main_~i~0 7)} assume true; {3750#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:31,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {3750#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3750#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:31,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {3750#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3751#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:31,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {3751#(<= main_~i~0 8)} assume true; {3751#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:31,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {3751#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3751#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:31,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {3751#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3752#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:31,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {3752#(<= main_~i~0 9)} assume true; {3752#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:31,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {3752#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3752#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:31,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {3752#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3753#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:31,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {3753#(<= main_~i~0 10)} assume true; {3753#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:31,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {3753#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3753#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:31,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {3753#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3754#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:31,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {3754#(<= main_~i~0 11)} assume true; {3754#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:31,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {3754#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3754#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:31,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {3754#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3755#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:31,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {3755#(<= main_~i~0 12)} assume true; {3755#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:31,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {3755#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3755#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:31,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {3755#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3756#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:31,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {3756#(<= main_~i~0 13)} assume true; {3756#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:31,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {3756#(<= main_~i~0 13)} assume !(~i~0 < 2048); {3742#false} is VALID [2018-11-14 17:32:31,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {3742#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {3742#false} is VALID [2018-11-14 17:32:31,415 INFO L256 TraceCheckUtils]: 48: Hoare triple {3742#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3742#false} is VALID [2018-11-14 17:32:31,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {3742#false} ~cond := #in~cond; {3742#false} is VALID [2018-11-14 17:32:31,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {3742#false} assume ~cond == 0; {3742#false} is VALID [2018-11-14 17:32:31,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {3742#false} assume !false; {3742#false} is VALID [2018-11-14 17:32:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:31,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:32:31,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 17:32:31,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:31,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:32:31,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:31,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:32:31,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:32:31,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:32:31,519 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 17 states. [2018-11-14 17:32:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:31,798 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-14 17:32:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:32:31,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 17:32:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:32:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2018-11-14 17:32:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:32:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2018-11-14 17:32:31,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2018-11-14 17:32:32,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:32,245 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:32:32,246 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:32:32,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:32:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:32:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-14 17:32:32,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:32,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-14 17:32:32,292 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-14 17:32:32,292 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-14 17:32:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:32,294 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-14 17:32:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-14 17:32:32,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:32,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:32,294 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-14 17:32:32,294 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-14 17:32:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:32,296 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-14 17:32:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-14 17:32:32,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:32,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:32,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:32,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:32:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-14 17:32:32,297 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-11-14 17:32:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:32,298 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-14 17:32:32,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:32:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-14 17:32:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:32:32,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:32,299 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:32,299 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:32,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1937810179, now seen corresponding path program 14 times [2018-11-14 17:32:32,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:32,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:32,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:32,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {4190#true} call ULTIMATE.init(); {4190#true} is VALID [2018-11-14 17:32:32,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {4190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4190#true} is VALID [2018-11-14 17:32:32,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {4190#true} assume true; {4190#true} is VALID [2018-11-14 17:32:32,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4190#true} {4190#true} #36#return; {4190#true} is VALID [2018-11-14 17:32:32,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {4190#true} call #t~ret4 := main(); {4190#true} is VALID [2018-11-14 17:32:32,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {4190#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4192#(= main_~i~0 0)} is VALID [2018-11-14 17:32:32,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {4192#(= main_~i~0 0)} assume true; {4192#(= main_~i~0 0)} is VALID [2018-11-14 17:32:32,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {4192#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4192#(= main_~i~0 0)} is VALID [2018-11-14 17:32:32,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {4192#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:32,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {4193#(<= main_~i~0 1)} assume true; {4193#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:32,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {4193#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4193#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:32,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {4193#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4194#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:32,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {4194#(<= main_~i~0 2)} assume true; {4194#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:32,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {4194#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4194#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:32,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {4194#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4195#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:32,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {4195#(<= main_~i~0 3)} assume true; {4195#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:32,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {4195#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4195#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:32,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {4195#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4196#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:32,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {4196#(<= main_~i~0 4)} assume true; {4196#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:32,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {4196#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4196#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:32,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {4196#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4197#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:32,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {4197#(<= main_~i~0 5)} assume true; {4197#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:32,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {4197#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4197#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:32,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {4197#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4198#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:32,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {4198#(<= main_~i~0 6)} assume true; {4198#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:32,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {4198#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4198#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:32,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {4198#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4199#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:32,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {4199#(<= main_~i~0 7)} assume true; {4199#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:32,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {4199#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4199#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:32,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {4199#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4200#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:32,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {4200#(<= main_~i~0 8)} assume true; {4200#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:32,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {4200#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4200#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:32,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {4200#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4201#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:32,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {4201#(<= main_~i~0 9)} assume true; {4201#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:32,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {4201#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4201#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:32,807 INFO L273 TraceCheckUtils]: 35: Hoare triple {4201#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4202#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:32,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {4202#(<= main_~i~0 10)} assume true; {4202#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:32,808 INFO L273 TraceCheckUtils]: 37: Hoare triple {4202#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4202#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:32,809 INFO L273 TraceCheckUtils]: 38: Hoare triple {4202#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4203#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:32,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {4203#(<= main_~i~0 11)} assume true; {4203#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:32,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {4203#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4203#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:32,811 INFO L273 TraceCheckUtils]: 41: Hoare triple {4203#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4204#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:32,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {4204#(<= main_~i~0 12)} assume true; {4204#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:32,812 INFO L273 TraceCheckUtils]: 43: Hoare triple {4204#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4204#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:32,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {4204#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4205#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:32,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {4205#(<= main_~i~0 13)} assume true; {4205#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:32,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {4205#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4205#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:32,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {4205#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4206#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:32,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {4206#(<= main_~i~0 14)} assume true; {4206#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:32,816 INFO L273 TraceCheckUtils]: 49: Hoare triple {4206#(<= main_~i~0 14)} assume !(~i~0 < 2048); {4191#false} is VALID [2018-11-14 17:32:32,816 INFO L273 TraceCheckUtils]: 50: Hoare triple {4191#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {4191#false} is VALID [2018-11-14 17:32:32,816 INFO L256 TraceCheckUtils]: 51: Hoare triple {4191#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4191#false} is VALID [2018-11-14 17:32:32,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {4191#false} ~cond := #in~cond; {4191#false} is VALID [2018-11-14 17:32:32,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {4191#false} assume ~cond == 0; {4191#false} is VALID [2018-11-14 17:32:32,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {4191#false} assume !false; {4191#false} is VALID [2018-11-14 17:32:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:32,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:32,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:32,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:32,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:32,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:32,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:33,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {4190#true} call ULTIMATE.init(); {4190#true} is VALID [2018-11-14 17:32:33,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {4190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4190#true} is VALID [2018-11-14 17:32:33,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {4190#true} assume true; {4190#true} is VALID [2018-11-14 17:32:33,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4190#true} {4190#true} #36#return; {4190#true} is VALID [2018-11-14 17:32:33,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {4190#true} call #t~ret4 := main(); {4190#true} is VALID [2018-11-14 17:32:33,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {4190#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4225#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:33,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {4225#(<= main_~i~0 0)} assume true; {4225#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:33,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {4225#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4225#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:33,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {4225#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:33,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {4193#(<= main_~i~0 1)} assume true; {4193#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:33,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {4193#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4193#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:33,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {4193#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4194#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:33,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {4194#(<= main_~i~0 2)} assume true; {4194#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:33,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {4194#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4194#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:33,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {4194#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4195#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:33,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {4195#(<= main_~i~0 3)} assume true; {4195#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:33,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {4195#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4195#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:33,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {4195#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4196#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:33,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {4196#(<= main_~i~0 4)} assume true; {4196#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:33,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {4196#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4196#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:33,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {4196#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4197#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:33,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {4197#(<= main_~i~0 5)} assume true; {4197#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:33,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {4197#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4197#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:33,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {4197#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4198#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:33,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {4198#(<= main_~i~0 6)} assume true; {4198#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:33,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {4198#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4198#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:33,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {4198#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4199#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:33,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {4199#(<= main_~i~0 7)} assume true; {4199#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:33,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {4199#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4199#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:33,026 INFO L273 TraceCheckUtils]: 29: Hoare triple {4199#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4200#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:33,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {4200#(<= main_~i~0 8)} assume true; {4200#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:33,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {4200#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4200#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:33,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {4200#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4201#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:33,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {4201#(<= main_~i~0 9)} assume true; {4201#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:33,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {4201#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4201#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:33,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {4201#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4202#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:33,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {4202#(<= main_~i~0 10)} assume true; {4202#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:33,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {4202#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4202#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:33,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {4202#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4203#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:33,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {4203#(<= main_~i~0 11)} assume true; {4203#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:33,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {4203#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4203#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:33,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {4203#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4204#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:33,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {4204#(<= main_~i~0 12)} assume true; {4204#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:33,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {4204#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4204#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:33,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {4204#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4205#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:33,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {4205#(<= main_~i~0 13)} assume true; {4205#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:33,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {4205#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4205#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:33,036 INFO L273 TraceCheckUtils]: 47: Hoare triple {4205#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4206#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:33,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {4206#(<= main_~i~0 14)} assume true; {4206#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:33,038 INFO L273 TraceCheckUtils]: 49: Hoare triple {4206#(<= main_~i~0 14)} assume !(~i~0 < 2048); {4191#false} is VALID [2018-11-14 17:32:33,038 INFO L273 TraceCheckUtils]: 50: Hoare triple {4191#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {4191#false} is VALID [2018-11-14 17:32:33,038 INFO L256 TraceCheckUtils]: 51: Hoare triple {4191#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4191#false} is VALID [2018-11-14 17:32:33,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {4191#false} ~cond := #in~cond; {4191#false} is VALID [2018-11-14 17:32:33,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {4191#false} assume ~cond == 0; {4191#false} is VALID [2018-11-14 17:32:33,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {4191#false} assume !false; {4191#false} is VALID [2018-11-14 17:32:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:33,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:33,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 17:32:33,062 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-14 17:32:33,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:33,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:32:33,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:33,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:32:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:32:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:32:33,118 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 18 states. [2018-11-14 17:32:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:33,355 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-14 17:32:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:32:33,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-14 17:32:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:32:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2018-11-14 17:32:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:32:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2018-11-14 17:32:33,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 66 transitions. [2018-11-14 17:32:33,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:33,873 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:32:33,874 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:32:33,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:32:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:32:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-14 17:32:33,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:33,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-14 17:32:33,893 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-14 17:32:33,893 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-14 17:32:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:33,895 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 17:32:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-14 17:32:33,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:33,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:33,896 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-14 17:32:33,896 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-14 17:32:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:33,897 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 17:32:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-14 17:32:33,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:33,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:33,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:33,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:32:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-14 17:32:33,899 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-11-14 17:32:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:33,900 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-14 17:32:33,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:32:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-14 17:32:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:32:33,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:33,901 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:33,901 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:33,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1741369402, now seen corresponding path program 15 times [2018-11-14 17:32:33,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:33,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:33,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:34,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {4663#true} call ULTIMATE.init(); {4663#true} is VALID [2018-11-14 17:32:34,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {4663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4663#true} is VALID [2018-11-14 17:32:34,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {4663#true} assume true; {4663#true} is VALID [2018-11-14 17:32:34,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4663#true} {4663#true} #36#return; {4663#true} is VALID [2018-11-14 17:32:34,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {4663#true} call #t~ret4 := main(); {4663#true} is VALID [2018-11-14 17:32:34,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {4663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4665#(= main_~i~0 0)} is VALID [2018-11-14 17:32:34,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {4665#(= main_~i~0 0)} assume true; {4665#(= main_~i~0 0)} is VALID [2018-11-14 17:32:34,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {4665#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4665#(= main_~i~0 0)} is VALID [2018-11-14 17:32:34,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {4665#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4666#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:34,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {4666#(<= main_~i~0 1)} assume true; {4666#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:34,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {4666#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4666#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:34,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {4666#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4667#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:34,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {4667#(<= main_~i~0 2)} assume true; {4667#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:34,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {4667#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4667#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:34,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {4667#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4668#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:34,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {4668#(<= main_~i~0 3)} assume true; {4668#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:34,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {4668#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4668#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:34,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {4668#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4669#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:34,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {4669#(<= main_~i~0 4)} assume true; {4669#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:34,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {4669#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4669#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:34,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {4669#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4670#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:34,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {4670#(<= main_~i~0 5)} assume true; {4670#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:34,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {4670#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4670#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:34,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {4670#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4671#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:34,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#(<= main_~i~0 6)} assume true; {4671#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:34,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4671#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:34,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4672#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:34,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {4672#(<= main_~i~0 7)} assume true; {4672#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:34,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {4672#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4672#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:34,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {4672#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4673#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:34,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {4673#(<= main_~i~0 8)} assume true; {4673#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:34,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {4673#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4673#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:34,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {4673#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4674#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:34,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {4674#(<= main_~i~0 9)} assume true; {4674#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:34,166 INFO L273 TraceCheckUtils]: 34: Hoare triple {4674#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4674#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:34,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {4674#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4675#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:34,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {4675#(<= main_~i~0 10)} assume true; {4675#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:34,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {4675#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4675#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:34,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {4675#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4676#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:34,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {4676#(<= main_~i~0 11)} assume true; {4676#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:34,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {4676#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4676#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:34,171 INFO L273 TraceCheckUtils]: 41: Hoare triple {4676#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4677#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:34,171 INFO L273 TraceCheckUtils]: 42: Hoare triple {4677#(<= main_~i~0 12)} assume true; {4677#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:34,172 INFO L273 TraceCheckUtils]: 43: Hoare triple {4677#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4677#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:34,173 INFO L273 TraceCheckUtils]: 44: Hoare triple {4677#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4678#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:34,173 INFO L273 TraceCheckUtils]: 45: Hoare triple {4678#(<= main_~i~0 13)} assume true; {4678#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:34,174 INFO L273 TraceCheckUtils]: 46: Hoare triple {4678#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4678#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:34,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {4678#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4679#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:34,175 INFO L273 TraceCheckUtils]: 48: Hoare triple {4679#(<= main_~i~0 14)} assume true; {4679#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:34,175 INFO L273 TraceCheckUtils]: 49: Hoare triple {4679#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4679#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:34,176 INFO L273 TraceCheckUtils]: 50: Hoare triple {4679#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4680#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:34,177 INFO L273 TraceCheckUtils]: 51: Hoare triple {4680#(<= main_~i~0 15)} assume true; {4680#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:34,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {4680#(<= main_~i~0 15)} assume !(~i~0 < 2048); {4664#false} is VALID [2018-11-14 17:32:34,178 INFO L273 TraceCheckUtils]: 53: Hoare triple {4664#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {4664#false} is VALID [2018-11-14 17:32:34,178 INFO L256 TraceCheckUtils]: 54: Hoare triple {4664#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4664#false} is VALID [2018-11-14 17:32:34,178 INFO L273 TraceCheckUtils]: 55: Hoare triple {4664#false} ~cond := #in~cond; {4664#false} is VALID [2018-11-14 17:32:34,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {4664#false} assume ~cond == 0; {4664#false} is VALID [2018-11-14 17:32:34,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {4664#false} assume !false; {4664#false} is VALID [2018-11-14 17:32:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:34,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:34,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:34,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:32:34,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 17:32:34,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:34,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:34,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {4663#true} call ULTIMATE.init(); {4663#true} is VALID [2018-11-14 17:32:34,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {4663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4663#true} is VALID [2018-11-14 17:32:34,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {4663#true} assume true; {4663#true} is VALID [2018-11-14 17:32:34,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4663#true} {4663#true} #36#return; {4663#true} is VALID [2018-11-14 17:32:34,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {4663#true} call #t~ret4 := main(); {4663#true} is VALID [2018-11-14 17:32:34,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {4663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4699#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:34,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {4699#(<= main_~i~0 0)} assume true; {4699#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:34,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {4699#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4699#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:34,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {4699#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4666#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:34,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {4666#(<= main_~i~0 1)} assume true; {4666#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:34,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {4666#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4666#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:34,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {4666#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4667#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:34,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {4667#(<= main_~i~0 2)} assume true; {4667#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:34,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {4667#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4667#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:34,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {4667#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4668#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:34,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {4668#(<= main_~i~0 3)} assume true; {4668#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:34,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {4668#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4668#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:34,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {4668#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4669#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:34,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {4669#(<= main_~i~0 4)} assume true; {4669#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:34,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {4669#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4669#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:34,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {4669#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4670#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:34,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {4670#(<= main_~i~0 5)} assume true; {4670#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:34,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {4670#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4670#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:34,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {4670#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4671#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:34,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#(<= main_~i~0 6)} assume true; {4671#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:34,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4671#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:34,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4672#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:34,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {4672#(<= main_~i~0 7)} assume true; {4672#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:34,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {4672#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4672#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:34,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {4672#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4673#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:34,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {4673#(<= main_~i~0 8)} assume true; {4673#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:34,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {4673#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4673#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:34,789 INFO L273 TraceCheckUtils]: 32: Hoare triple {4673#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4674#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:34,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {4674#(<= main_~i~0 9)} assume true; {4674#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:34,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {4674#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4674#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:34,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {4674#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4675#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:34,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {4675#(<= main_~i~0 10)} assume true; {4675#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:34,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {4675#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4675#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:34,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {4675#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4676#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:34,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {4676#(<= main_~i~0 11)} assume true; {4676#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:34,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {4676#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4676#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:34,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {4676#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4677#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:34,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {4677#(<= main_~i~0 12)} assume true; {4677#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:34,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {4677#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4677#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:34,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {4677#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4678#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:34,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {4678#(<= main_~i~0 13)} assume true; {4678#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:34,809 INFO L273 TraceCheckUtils]: 46: Hoare triple {4678#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4678#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:34,809 INFO L273 TraceCheckUtils]: 47: Hoare triple {4678#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4679#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:34,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {4679#(<= main_~i~0 14)} assume true; {4679#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:34,811 INFO L273 TraceCheckUtils]: 49: Hoare triple {4679#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4679#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:34,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {4679#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4680#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:34,813 INFO L273 TraceCheckUtils]: 51: Hoare triple {4680#(<= main_~i~0 15)} assume true; {4680#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:34,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {4680#(<= main_~i~0 15)} assume !(~i~0 < 2048); {4664#false} is VALID [2018-11-14 17:32:34,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {4664#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {4664#false} is VALID [2018-11-14 17:32:34,815 INFO L256 TraceCheckUtils]: 54: Hoare triple {4664#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4664#false} is VALID [2018-11-14 17:32:34,815 INFO L273 TraceCheckUtils]: 55: Hoare triple {4664#false} ~cond := #in~cond; {4664#false} is VALID [2018-11-14 17:32:34,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {4664#false} assume ~cond == 0; {4664#false} is VALID [2018-11-14 17:32:34,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {4664#false} assume !false; {4664#false} is VALID [2018-11-14 17:32:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:34,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 17:32:34,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-14 17:32:34,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:34,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:32:34,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:34,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:32:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:32:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:32:34,916 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 19 states. [2018-11-14 17:32:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:35,248 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-14 17:32:35,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:32:35,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-14 17:32:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:32:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2018-11-14 17:32:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:32:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2018-11-14 17:32:35,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2018-11-14 17:32:36,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:36,100 INFO L225 Difference]: With dead ends: 69 [2018-11-14 17:32:36,100 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 17:32:36,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:32:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 17:32:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-14 17:32:36,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:36,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-14 17:32:36,126 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-14 17:32:36,127 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-14 17:32:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:36,128 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-14 17:32:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-14 17:32:36,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:36,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:36,128 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-14 17:32:36,129 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-14 17:32:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:36,130 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-14 17:32:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-14 17:32:36,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:36,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:36,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:36,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:32:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-14 17:32:36,132 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-11-14 17:32:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:36,132 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-14 17:32:36,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:32:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-14 17:32:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 17:32:36,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:36,133 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:36,134 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:36,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash -680361053, now seen corresponding path program 16 times [2018-11-14 17:32:36,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:36,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:37,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {5160#true} call ULTIMATE.init(); {5160#true} is VALID [2018-11-14 17:32:37,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {5160#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5160#true} is VALID [2018-11-14 17:32:37,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {5160#true} assume true; {5160#true} is VALID [2018-11-14 17:32:37,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5160#true} {5160#true} #36#return; {5160#true} is VALID [2018-11-14 17:32:37,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {5160#true} call #t~ret4 := main(); {5160#true} is VALID [2018-11-14 17:32:37,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {5160#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5162#(= main_~i~0 0)} is VALID [2018-11-14 17:32:37,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {5162#(= main_~i~0 0)} assume true; {5162#(= main_~i~0 0)} is VALID [2018-11-14 17:32:37,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {5162#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5162#(= main_~i~0 0)} is VALID [2018-11-14 17:32:37,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {5162#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5163#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:37,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {5163#(<= main_~i~0 1)} assume true; {5163#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:37,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {5163#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5163#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:37,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {5163#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5164#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:37,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {5164#(<= main_~i~0 2)} assume true; {5164#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:37,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {5164#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5164#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:37,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {5164#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5165#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:37,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {5165#(<= main_~i~0 3)} assume true; {5165#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:37,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {5165#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5165#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:37,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {5165#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5166#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:37,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {5166#(<= main_~i~0 4)} assume true; {5166#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:37,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {5166#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5166#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:37,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {5166#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5167#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:37,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {5167#(<= main_~i~0 5)} assume true; {5167#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:37,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {5167#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5167#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:37,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {5167#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5168#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:37,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {5168#(<= main_~i~0 6)} assume true; {5168#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:37,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {5168#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5168#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:37,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {5168#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5169#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:37,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {5169#(<= main_~i~0 7)} assume true; {5169#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:37,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {5169#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5169#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:37,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {5169#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5170#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:37,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {5170#(<= main_~i~0 8)} assume true; {5170#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:37,378 INFO L273 TraceCheckUtils]: 31: Hoare triple {5170#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5170#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:37,378 INFO L273 TraceCheckUtils]: 32: Hoare triple {5170#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5171#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:37,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {5171#(<= main_~i~0 9)} assume true; {5171#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:37,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {5171#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5171#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:37,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {5171#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5172#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:37,381 INFO L273 TraceCheckUtils]: 36: Hoare triple {5172#(<= main_~i~0 10)} assume true; {5172#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:37,381 INFO L273 TraceCheckUtils]: 37: Hoare triple {5172#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5172#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:37,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {5172#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5173#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:37,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {5173#(<= main_~i~0 11)} assume true; {5173#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:37,383 INFO L273 TraceCheckUtils]: 40: Hoare triple {5173#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5173#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:37,384 INFO L273 TraceCheckUtils]: 41: Hoare triple {5173#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5174#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:37,384 INFO L273 TraceCheckUtils]: 42: Hoare triple {5174#(<= main_~i~0 12)} assume true; {5174#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:37,385 INFO L273 TraceCheckUtils]: 43: Hoare triple {5174#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5174#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:37,386 INFO L273 TraceCheckUtils]: 44: Hoare triple {5174#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5175#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:37,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {5175#(<= main_~i~0 13)} assume true; {5175#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:37,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {5175#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5175#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:37,387 INFO L273 TraceCheckUtils]: 47: Hoare triple {5175#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5176#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:37,388 INFO L273 TraceCheckUtils]: 48: Hoare triple {5176#(<= main_~i~0 14)} assume true; {5176#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:37,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {5176#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5176#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:37,389 INFO L273 TraceCheckUtils]: 50: Hoare triple {5176#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5177#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:37,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {5177#(<= main_~i~0 15)} assume true; {5177#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:37,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {5177#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5177#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:37,391 INFO L273 TraceCheckUtils]: 53: Hoare triple {5177#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5178#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:37,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {5178#(<= main_~i~0 16)} assume true; {5178#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:37,392 INFO L273 TraceCheckUtils]: 55: Hoare triple {5178#(<= main_~i~0 16)} assume !(~i~0 < 2048); {5161#false} is VALID [2018-11-14 17:32:37,393 INFO L273 TraceCheckUtils]: 56: Hoare triple {5161#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {5161#false} is VALID [2018-11-14 17:32:37,393 INFO L256 TraceCheckUtils]: 57: Hoare triple {5161#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5161#false} is VALID [2018-11-14 17:32:37,393 INFO L273 TraceCheckUtils]: 58: Hoare triple {5161#false} ~cond := #in~cond; {5161#false} is VALID [2018-11-14 17:32:37,393 INFO L273 TraceCheckUtils]: 59: Hoare triple {5161#false} assume ~cond == 0; {5161#false} is VALID [2018-11-14 17:32:37,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {5161#false} assume !false; {5161#false} is VALID [2018-11-14 17:32:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:37,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:37,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:32:37,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:32:37,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:37,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:37,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {5160#true} call ULTIMATE.init(); {5160#true} is VALID [2018-11-14 17:32:37,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {5160#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5160#true} is VALID [2018-11-14 17:32:37,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {5160#true} assume true; {5160#true} is VALID [2018-11-14 17:32:37,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5160#true} {5160#true} #36#return; {5160#true} is VALID [2018-11-14 17:32:37,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {5160#true} call #t~ret4 := main(); {5160#true} is VALID [2018-11-14 17:32:37,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {5160#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5197#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:37,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {5197#(<= main_~i~0 0)} assume true; {5197#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:37,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {5197#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5197#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:37,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {5197#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5163#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:37,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {5163#(<= main_~i~0 1)} assume true; {5163#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:37,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {5163#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5163#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:37,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {5163#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5164#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:37,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {5164#(<= main_~i~0 2)} assume true; {5164#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:37,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {5164#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5164#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:37,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {5164#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5165#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:37,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {5165#(<= main_~i~0 3)} assume true; {5165#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:37,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {5165#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5165#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:37,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {5165#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5166#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:37,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {5166#(<= main_~i~0 4)} assume true; {5166#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:37,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {5166#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5166#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:37,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {5166#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5167#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:37,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {5167#(<= main_~i~0 5)} assume true; {5167#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:37,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {5167#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5167#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:37,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {5167#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5168#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:37,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {5168#(<= main_~i~0 6)} assume true; {5168#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:37,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {5168#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5168#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:37,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {5168#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5169#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:37,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {5169#(<= main_~i~0 7)} assume true; {5169#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:37,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {5169#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5169#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:37,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {5169#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5170#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:37,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {5170#(<= main_~i~0 8)} assume true; {5170#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:37,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {5170#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5170#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:37,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {5170#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5171#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:37,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {5171#(<= main_~i~0 9)} assume true; {5171#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:37,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {5171#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5171#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:37,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {5171#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5172#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:37,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {5172#(<= main_~i~0 10)} assume true; {5172#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:37,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {5172#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5172#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:37,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {5172#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5173#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:37,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {5173#(<= main_~i~0 11)} assume true; {5173#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:37,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {5173#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5173#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:37,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {5173#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5174#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:37,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {5174#(<= main_~i~0 12)} assume true; {5174#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:37,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {5174#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5174#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:37,640 INFO L273 TraceCheckUtils]: 44: Hoare triple {5174#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5175#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:37,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {5175#(<= main_~i~0 13)} assume true; {5175#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:37,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {5175#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5175#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:37,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {5175#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5176#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:37,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {5176#(<= main_~i~0 14)} assume true; {5176#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:37,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {5176#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5176#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:37,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {5176#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5177#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:37,644 INFO L273 TraceCheckUtils]: 51: Hoare triple {5177#(<= main_~i~0 15)} assume true; {5177#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:37,645 INFO L273 TraceCheckUtils]: 52: Hoare triple {5177#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5177#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:37,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {5177#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5178#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:37,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {5178#(<= main_~i~0 16)} assume true; {5178#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:37,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {5178#(<= main_~i~0 16)} assume !(~i~0 < 2048); {5161#false} is VALID [2018-11-14 17:32:37,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {5161#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {5161#false} is VALID [2018-11-14 17:32:37,647 INFO L256 TraceCheckUtils]: 57: Hoare triple {5161#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5161#false} is VALID [2018-11-14 17:32:37,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {5161#false} ~cond := #in~cond; {5161#false} is VALID [2018-11-14 17:32:37,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {5161#false} assume ~cond == 0; {5161#false} is VALID [2018-11-14 17:32:37,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {5161#false} assume !false; {5161#false} is VALID [2018-11-14 17:32:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:37,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 17:32:37,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-14 17:32:37,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:37,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:32:37,735 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-14 17:32:37,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:32:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:32:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:32:37,736 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 20 states. [2018-11-14 17:32:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:38,199 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-14 17:32:38,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:32:38,199 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-14 17:32:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:32:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2018-11-14 17:32:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:32:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2018-11-14 17:32:38,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2018-11-14 17:32:38,271 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-14 17:32:38,273 INFO L225 Difference]: With dead ends: 72 [2018-11-14 17:32:38,273 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:32:38,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:32:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:32:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 17:32:38,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:38,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 17:32:38,319 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 17:32:38,319 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 17:32:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:38,321 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-14 17:32:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-14 17:32:38,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:38,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:38,321 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 17:32:38,322 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 17:32:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:38,323 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-14 17:32:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-14 17:32:38,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:38,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:38,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:38,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:32:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-14 17:32:38,325 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-11-14 17:32:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:38,326 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-14 17:32:38,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:32:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-14 17:32:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-14 17:32:38,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:38,327 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:38,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:38,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:38,327 INFO L82 PathProgramCache]: Analyzing trace with hash 408292250, now seen corresponding path program 17 times [2018-11-14 17:32:38,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:38,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:38,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:38,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:38,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:39,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {5681#true} call ULTIMATE.init(); {5681#true} is VALID [2018-11-14 17:32:39,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {5681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5681#true} is VALID [2018-11-14 17:32:39,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {5681#true} assume true; {5681#true} is VALID [2018-11-14 17:32:39,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5681#true} {5681#true} #36#return; {5681#true} is VALID [2018-11-14 17:32:39,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {5681#true} call #t~ret4 := main(); {5681#true} is VALID [2018-11-14 17:32:39,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {5681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5683#(= main_~i~0 0)} is VALID [2018-11-14 17:32:39,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {5683#(= main_~i~0 0)} assume true; {5683#(= main_~i~0 0)} is VALID [2018-11-14 17:32:39,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {5683#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5683#(= main_~i~0 0)} is VALID [2018-11-14 17:32:39,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {5683#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5684#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:39,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {5684#(<= main_~i~0 1)} assume true; {5684#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:39,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {5684#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5684#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:39,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {5684#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5685#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:39,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {5685#(<= main_~i~0 2)} assume true; {5685#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:39,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {5685#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5685#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:39,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {5685#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5686#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:39,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {5686#(<= main_~i~0 3)} assume true; {5686#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:39,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {5686#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5686#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:39,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {5686#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5687#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:39,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {5687#(<= main_~i~0 4)} assume true; {5687#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:39,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {5687#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5687#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:39,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {5687#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5688#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:39,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {5688#(<= main_~i~0 5)} assume true; {5688#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:39,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {5688#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5688#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:39,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {5688#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5689#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:39,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {5689#(<= main_~i~0 6)} assume true; {5689#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:39,065 INFO L273 TraceCheckUtils]: 25: Hoare triple {5689#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5689#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:39,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {5689#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5690#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:39,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {5690#(<= main_~i~0 7)} assume true; {5690#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:39,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {5690#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5690#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:39,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {5690#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5691#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:39,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {5691#(<= main_~i~0 8)} assume true; {5691#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:39,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {5691#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5691#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:39,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {5691#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5692#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:39,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {5692#(<= main_~i~0 9)} assume true; {5692#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:39,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {5692#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5692#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:39,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {5692#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5693#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:39,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {5693#(<= main_~i~0 10)} assume true; {5693#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:39,121 INFO L273 TraceCheckUtils]: 37: Hoare triple {5693#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5693#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:39,122 INFO L273 TraceCheckUtils]: 38: Hoare triple {5693#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5694#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:39,122 INFO L273 TraceCheckUtils]: 39: Hoare triple {5694#(<= main_~i~0 11)} assume true; {5694#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:39,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {5694#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5694#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:39,123 INFO L273 TraceCheckUtils]: 41: Hoare triple {5694#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5695#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:39,123 INFO L273 TraceCheckUtils]: 42: Hoare triple {5695#(<= main_~i~0 12)} assume true; {5695#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:39,124 INFO L273 TraceCheckUtils]: 43: Hoare triple {5695#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5695#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:39,124 INFO L273 TraceCheckUtils]: 44: Hoare triple {5695#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5696#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:39,124 INFO L273 TraceCheckUtils]: 45: Hoare triple {5696#(<= main_~i~0 13)} assume true; {5696#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:39,125 INFO L273 TraceCheckUtils]: 46: Hoare triple {5696#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5696#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:39,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {5696#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5697#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:39,125 INFO L273 TraceCheckUtils]: 48: Hoare triple {5697#(<= main_~i~0 14)} assume true; {5697#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:39,126 INFO L273 TraceCheckUtils]: 49: Hoare triple {5697#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5697#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:39,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {5697#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5698#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:39,127 INFO L273 TraceCheckUtils]: 51: Hoare triple {5698#(<= main_~i~0 15)} assume true; {5698#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:39,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {5698#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5698#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:39,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {5698#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5699#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:39,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {5699#(<= main_~i~0 16)} assume true; {5699#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:39,130 INFO L273 TraceCheckUtils]: 55: Hoare triple {5699#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5699#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:39,130 INFO L273 TraceCheckUtils]: 56: Hoare triple {5699#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5700#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:39,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {5700#(<= main_~i~0 17)} assume true; {5700#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:39,131 INFO L273 TraceCheckUtils]: 58: Hoare triple {5700#(<= main_~i~0 17)} assume !(~i~0 < 2048); {5682#false} is VALID [2018-11-14 17:32:39,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {5682#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {5682#false} is VALID [2018-11-14 17:32:39,132 INFO L256 TraceCheckUtils]: 60: Hoare triple {5682#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5682#false} is VALID [2018-11-14 17:32:39,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {5682#false} ~cond := #in~cond; {5682#false} is VALID [2018-11-14 17:32:39,132 INFO L273 TraceCheckUtils]: 62: Hoare triple {5682#false} assume ~cond == 0; {5682#false} is VALID [2018-11-14 17:32:39,132 INFO L273 TraceCheckUtils]: 63: Hoare triple {5682#false} assume !false; {5682#false} is VALID [2018-11-14 17:32:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:39,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:39,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:39,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:32:39,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 17:32:39,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:39,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:39,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {5681#true} call ULTIMATE.init(); {5681#true} is VALID [2018-11-14 17:32:39,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {5681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5681#true} is VALID [2018-11-14 17:32:39,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {5681#true} assume true; {5681#true} is VALID [2018-11-14 17:32:39,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5681#true} {5681#true} #36#return; {5681#true} is VALID [2018-11-14 17:32:39,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {5681#true} call #t~ret4 := main(); {5681#true} is VALID [2018-11-14 17:32:39,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {5681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5719#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:39,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {5719#(<= main_~i~0 0)} assume true; {5719#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:39,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {5719#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5719#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:39,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {5719#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5684#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:39,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {5684#(<= main_~i~0 1)} assume true; {5684#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:39,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {5684#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5684#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:39,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {5684#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5685#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:39,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {5685#(<= main_~i~0 2)} assume true; {5685#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:39,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {5685#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5685#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:39,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {5685#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5686#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:39,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {5686#(<= main_~i~0 3)} assume true; {5686#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:39,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {5686#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5686#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:39,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {5686#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5687#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:39,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {5687#(<= main_~i~0 4)} assume true; {5687#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:39,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {5687#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5687#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:39,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {5687#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5688#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:39,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {5688#(<= main_~i~0 5)} assume true; {5688#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:39,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {5688#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5688#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:39,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {5688#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5689#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:39,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {5689#(<= main_~i~0 6)} assume true; {5689#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:39,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {5689#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5689#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:39,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {5689#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5690#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:39,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {5690#(<= main_~i~0 7)} assume true; {5690#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:39,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {5690#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5690#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:39,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {5690#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5691#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:39,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {5691#(<= main_~i~0 8)} assume true; {5691#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:39,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {5691#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5691#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:39,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {5691#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5692#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:39,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {5692#(<= main_~i~0 9)} assume true; {5692#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:39,692 INFO L273 TraceCheckUtils]: 34: Hoare triple {5692#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5692#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:39,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {5692#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5693#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:39,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {5693#(<= main_~i~0 10)} assume true; {5693#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:39,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {5693#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5693#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:39,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {5693#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5694#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:39,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {5694#(<= main_~i~0 11)} assume true; {5694#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:39,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {5694#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5694#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:39,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {5694#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5695#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:39,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {5695#(<= main_~i~0 12)} assume true; {5695#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:39,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {5695#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5695#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:39,699 INFO L273 TraceCheckUtils]: 44: Hoare triple {5695#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5696#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:39,700 INFO L273 TraceCheckUtils]: 45: Hoare triple {5696#(<= main_~i~0 13)} assume true; {5696#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:39,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {5696#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5696#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:39,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {5696#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5697#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:39,701 INFO L273 TraceCheckUtils]: 48: Hoare triple {5697#(<= main_~i~0 14)} assume true; {5697#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:39,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {5697#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5697#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:39,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {5697#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5698#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:39,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {5698#(<= main_~i~0 15)} assume true; {5698#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:39,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {5698#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5698#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:39,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {5698#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5699#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:39,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {5699#(<= main_~i~0 16)} assume true; {5699#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:39,706 INFO L273 TraceCheckUtils]: 55: Hoare triple {5699#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5699#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:39,706 INFO L273 TraceCheckUtils]: 56: Hoare triple {5699#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5700#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:39,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {5700#(<= main_~i~0 17)} assume true; {5700#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:39,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {5700#(<= main_~i~0 17)} assume !(~i~0 < 2048); {5682#false} is VALID [2018-11-14 17:32:39,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {5682#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {5682#false} is VALID [2018-11-14 17:32:39,708 INFO L256 TraceCheckUtils]: 60: Hoare triple {5682#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5682#false} is VALID [2018-11-14 17:32:39,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {5682#false} ~cond := #in~cond; {5682#false} is VALID [2018-11-14 17:32:39,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {5682#false} assume ~cond == 0; {5682#false} is VALID [2018-11-14 17:32:39,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {5682#false} assume !false; {5682#false} is VALID [2018-11-14 17:32:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 17:32:39,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-14 17:32:39,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:39,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 17:32:39,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:39,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 17:32:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 17:32:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:32:39,797 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 21 states. [2018-11-14 17:32:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:40,028 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-14 17:32:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:32:40,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-14 17:32:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:32:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 75 transitions. [2018-11-14 17:32:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:32:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 75 transitions. [2018-11-14 17:32:40,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 75 transitions. [2018-11-14 17:32:40,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:40,480 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:32:40,480 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:32:40,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:32:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:32:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 17:32:40,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:40,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 17:32:40,501 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 17:32:40,501 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 17:32:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:40,502 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-14 17:32:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-14 17:32:40,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:40,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:40,503 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 17:32:40,503 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 17:32:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:40,504 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-14 17:32:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-14 17:32:40,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:40,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:40,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:40,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:32:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-14 17:32:40,506 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-11-14 17:32:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:40,507 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-14 17:32:40,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 17:32:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-14 17:32:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 17:32:40,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:40,508 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:40,508 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:40,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1180789827, now seen corresponding path program 18 times [2018-11-14 17:32:40,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:40,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:41,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {6226#true} call ULTIMATE.init(); {6226#true} is VALID [2018-11-14 17:32:41,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {6226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6226#true} is VALID [2018-11-14 17:32:41,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {6226#true} assume true; {6226#true} is VALID [2018-11-14 17:32:41,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6226#true} {6226#true} #36#return; {6226#true} is VALID [2018-11-14 17:32:41,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {6226#true} call #t~ret4 := main(); {6226#true} is VALID [2018-11-14 17:32:41,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {6226#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6228#(= main_~i~0 0)} is VALID [2018-11-14 17:32:41,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {6228#(= main_~i~0 0)} assume true; {6228#(= main_~i~0 0)} is VALID [2018-11-14 17:32:41,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {6228#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6228#(= main_~i~0 0)} is VALID [2018-11-14 17:32:41,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {6228#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6229#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:41,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {6229#(<= main_~i~0 1)} assume true; {6229#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:41,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {6229#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6229#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:41,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {6229#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6230#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:41,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {6230#(<= main_~i~0 2)} assume true; {6230#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:41,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {6230#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6230#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:41,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {6230#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6231#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:41,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {6231#(<= main_~i~0 3)} assume true; {6231#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:41,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {6231#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6231#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:41,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {6231#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6232#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:41,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {6232#(<= main_~i~0 4)} assume true; {6232#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:41,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {6232#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6232#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:41,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {6232#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6233#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:41,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {6233#(<= main_~i~0 5)} assume true; {6233#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:41,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {6233#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6233#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:41,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {6233#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6234#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:41,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {6234#(<= main_~i~0 6)} assume true; {6234#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:41,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {6234#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6234#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:41,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {6234#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6235#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:41,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {6235#(<= main_~i~0 7)} assume true; {6235#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:41,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {6235#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6235#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:41,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {6235#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6236#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:41,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {6236#(<= main_~i~0 8)} assume true; {6236#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:41,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {6236#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6236#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:41,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {6236#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6237#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:41,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {6237#(<= main_~i~0 9)} assume true; {6237#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:41,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {6237#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6237#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:41,828 INFO L273 TraceCheckUtils]: 35: Hoare triple {6237#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6238#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:41,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {6238#(<= main_~i~0 10)} assume true; {6238#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:41,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {6238#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6238#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:41,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {6238#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6239#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:41,831 INFO L273 TraceCheckUtils]: 39: Hoare triple {6239#(<= main_~i~0 11)} assume true; {6239#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:41,831 INFO L273 TraceCheckUtils]: 40: Hoare triple {6239#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6239#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:41,832 INFO L273 TraceCheckUtils]: 41: Hoare triple {6239#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6240#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:41,833 INFO L273 TraceCheckUtils]: 42: Hoare triple {6240#(<= main_~i~0 12)} assume true; {6240#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:41,834 INFO L273 TraceCheckUtils]: 43: Hoare triple {6240#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6240#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:41,834 INFO L273 TraceCheckUtils]: 44: Hoare triple {6240#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6241#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:41,835 INFO L273 TraceCheckUtils]: 45: Hoare triple {6241#(<= main_~i~0 13)} assume true; {6241#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:41,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {6241#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6241#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:41,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {6241#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6242#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:41,837 INFO L273 TraceCheckUtils]: 48: Hoare triple {6242#(<= main_~i~0 14)} assume true; {6242#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:41,838 INFO L273 TraceCheckUtils]: 49: Hoare triple {6242#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6242#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:41,839 INFO L273 TraceCheckUtils]: 50: Hoare triple {6242#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6243#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:41,839 INFO L273 TraceCheckUtils]: 51: Hoare triple {6243#(<= main_~i~0 15)} assume true; {6243#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:41,840 INFO L273 TraceCheckUtils]: 52: Hoare triple {6243#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6243#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:41,841 INFO L273 TraceCheckUtils]: 53: Hoare triple {6243#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6244#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:41,841 INFO L273 TraceCheckUtils]: 54: Hoare triple {6244#(<= main_~i~0 16)} assume true; {6244#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:41,842 INFO L273 TraceCheckUtils]: 55: Hoare triple {6244#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6244#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:41,843 INFO L273 TraceCheckUtils]: 56: Hoare triple {6244#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6245#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:41,843 INFO L273 TraceCheckUtils]: 57: Hoare triple {6245#(<= main_~i~0 17)} assume true; {6245#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:41,844 INFO L273 TraceCheckUtils]: 58: Hoare triple {6245#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6245#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:41,845 INFO L273 TraceCheckUtils]: 59: Hoare triple {6245#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6246#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:41,846 INFO L273 TraceCheckUtils]: 60: Hoare triple {6246#(<= main_~i~0 18)} assume true; {6246#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:41,846 INFO L273 TraceCheckUtils]: 61: Hoare triple {6246#(<= main_~i~0 18)} assume !(~i~0 < 2048); {6227#false} is VALID [2018-11-14 17:32:41,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {6227#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {6227#false} is VALID [2018-11-14 17:32:41,847 INFO L256 TraceCheckUtils]: 63: Hoare triple {6227#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6227#false} is VALID [2018-11-14 17:32:41,847 INFO L273 TraceCheckUtils]: 64: Hoare triple {6227#false} ~cond := #in~cond; {6227#false} is VALID [2018-11-14 17:32:41,847 INFO L273 TraceCheckUtils]: 65: Hoare triple {6227#false} assume ~cond == 0; {6227#false} is VALID [2018-11-14 17:32:41,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {6227#false} assume !false; {6227#false} is VALID [2018-11-14 17:32:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:41,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:41,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:32:42,366 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 17:32:42,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:42,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:42,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {6226#true} call ULTIMATE.init(); {6226#true} is VALID [2018-11-14 17:32:42,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {6226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6226#true} is VALID [2018-11-14 17:32:42,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {6226#true} assume true; {6226#true} is VALID [2018-11-14 17:32:42,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6226#true} {6226#true} #36#return; {6226#true} is VALID [2018-11-14 17:32:42,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {6226#true} call #t~ret4 := main(); {6226#true} is VALID [2018-11-14 17:32:42,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {6226#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6265#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:42,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {6265#(<= main_~i~0 0)} assume true; {6265#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:42,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {6265#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6265#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:42,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {6265#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6229#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:42,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {6229#(<= main_~i~0 1)} assume true; {6229#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:42,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {6229#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6229#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:42,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {6229#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6230#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:42,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {6230#(<= main_~i~0 2)} assume true; {6230#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:42,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {6230#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6230#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:42,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {6230#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6231#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:42,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {6231#(<= main_~i~0 3)} assume true; {6231#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:42,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {6231#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6231#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:42,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {6231#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6232#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:42,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {6232#(<= main_~i~0 4)} assume true; {6232#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:42,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {6232#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6232#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:42,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {6232#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6233#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:42,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {6233#(<= main_~i~0 5)} assume true; {6233#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:42,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {6233#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6233#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:42,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {6233#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6234#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:42,678 INFO L273 TraceCheckUtils]: 24: Hoare triple {6234#(<= main_~i~0 6)} assume true; {6234#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:42,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {6234#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6234#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:42,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {6234#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6235#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:42,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {6235#(<= main_~i~0 7)} assume true; {6235#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:42,680 INFO L273 TraceCheckUtils]: 28: Hoare triple {6235#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6235#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:42,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {6235#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6236#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:42,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {6236#(<= main_~i~0 8)} assume true; {6236#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:42,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {6236#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6236#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:42,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {6236#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6237#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:42,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {6237#(<= main_~i~0 9)} assume true; {6237#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:42,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {6237#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6237#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:42,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {6237#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6238#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:42,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {6238#(<= main_~i~0 10)} assume true; {6238#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:42,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {6238#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6238#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:42,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {6238#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6239#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:42,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {6239#(<= main_~i~0 11)} assume true; {6239#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:42,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {6239#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6239#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:42,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {6239#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6240#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:42,690 INFO L273 TraceCheckUtils]: 42: Hoare triple {6240#(<= main_~i~0 12)} assume true; {6240#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:42,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {6240#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6240#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:42,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {6240#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6241#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:42,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {6241#(<= main_~i~0 13)} assume true; {6241#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:42,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {6241#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6241#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:42,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {6241#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6242#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:42,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {6242#(<= main_~i~0 14)} assume true; {6242#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:42,695 INFO L273 TraceCheckUtils]: 49: Hoare triple {6242#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6242#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:42,696 INFO L273 TraceCheckUtils]: 50: Hoare triple {6242#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6243#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:42,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {6243#(<= main_~i~0 15)} assume true; {6243#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:42,697 INFO L273 TraceCheckUtils]: 52: Hoare triple {6243#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6243#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:42,698 INFO L273 TraceCheckUtils]: 53: Hoare triple {6243#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6244#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:42,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {6244#(<= main_~i~0 16)} assume true; {6244#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:42,699 INFO L273 TraceCheckUtils]: 55: Hoare triple {6244#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6244#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:42,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {6244#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6245#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:42,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {6245#(<= main_~i~0 17)} assume true; {6245#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:42,701 INFO L273 TraceCheckUtils]: 58: Hoare triple {6245#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6245#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:42,702 INFO L273 TraceCheckUtils]: 59: Hoare triple {6245#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6246#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:42,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {6246#(<= main_~i~0 18)} assume true; {6246#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:42,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {6246#(<= main_~i~0 18)} assume !(~i~0 < 2048); {6227#false} is VALID [2018-11-14 17:32:42,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {6227#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {6227#false} is VALID [2018-11-14 17:32:42,704 INFO L256 TraceCheckUtils]: 63: Hoare triple {6227#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6227#false} is VALID [2018-11-14 17:32:42,704 INFO L273 TraceCheckUtils]: 64: Hoare triple {6227#false} ~cond := #in~cond; {6227#false} is VALID [2018-11-14 17:32:42,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {6227#false} assume ~cond == 0; {6227#false} is VALID [2018-11-14 17:32:42,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {6227#false} assume !false; {6227#false} is VALID [2018-11-14 17:32:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:42,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:42,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 17:32:42,733 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-14 17:32:42,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:42,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:32:42,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:42,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:32:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:32:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:32:42,824 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 22 states. [2018-11-14 17:32:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:43,217 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-14 17:32:43,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 17:32:43,217 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-14 17:32:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:32:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2018-11-14 17:32:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:32:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2018-11-14 17:32:43,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 78 transitions. [2018-11-14 17:32:43,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:43,327 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:32:43,327 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 17:32:43,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:32:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 17:32:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-14 17:32:43,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:43,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-14 17:32:43,346 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-14 17:32:43,346 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-14 17:32:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:43,348 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-14 17:32:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-14 17:32:43,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:43,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:43,349 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-14 17:32:43,349 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-14 17:32:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:43,351 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-14 17:32:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-14 17:32:43,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:43,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:43,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:43,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 17:32:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-14 17:32:43,353 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-11-14 17:32:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:43,353 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-14 17:32:43,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:32:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-14 17:32:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:32:43,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:43,354 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:43,355 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:43,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2073633030, now seen corresponding path program 19 times [2018-11-14 17:32:43,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:43,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:44,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {6795#true} call ULTIMATE.init(); {6795#true} is VALID [2018-11-14 17:32:44,061 INFO L273 TraceCheckUtils]: 1: Hoare triple {6795#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6795#true} is VALID [2018-11-14 17:32:44,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {6795#true} assume true; {6795#true} is VALID [2018-11-14 17:32:44,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6795#true} {6795#true} #36#return; {6795#true} is VALID [2018-11-14 17:32:44,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {6795#true} call #t~ret4 := main(); {6795#true} is VALID [2018-11-14 17:32:44,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {6795#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6797#(= main_~i~0 0)} is VALID [2018-11-14 17:32:44,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {6797#(= main_~i~0 0)} assume true; {6797#(= main_~i~0 0)} is VALID [2018-11-14 17:32:44,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {6797#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6797#(= main_~i~0 0)} is VALID [2018-11-14 17:32:44,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {6797#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6798#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:44,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {6798#(<= main_~i~0 1)} assume true; {6798#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:44,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {6798#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6798#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:44,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {6798#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6799#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:44,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {6799#(<= main_~i~0 2)} assume true; {6799#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:44,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {6799#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6799#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:44,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {6799#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6800#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:44,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {6800#(<= main_~i~0 3)} assume true; {6800#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:44,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {6800#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6800#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:44,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {6800#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6801#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:44,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {6801#(<= main_~i~0 4)} assume true; {6801#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:44,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {6801#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6801#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:44,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {6801#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6802#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:44,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {6802#(<= main_~i~0 5)} assume true; {6802#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:44,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {6802#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6802#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:44,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {6802#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6803#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:44,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {6803#(<= main_~i~0 6)} assume true; {6803#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:44,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {6803#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6803#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:44,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {6803#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6804#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:44,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {6804#(<= main_~i~0 7)} assume true; {6804#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:44,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {6804#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6804#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:44,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {6804#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6805#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:44,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {6805#(<= main_~i~0 8)} assume true; {6805#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:44,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {6805#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6805#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:44,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {6805#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6806#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:44,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {6806#(<= main_~i~0 9)} assume true; {6806#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:44,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {6806#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6806#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:44,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {6806#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6807#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:44,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {6807#(<= main_~i~0 10)} assume true; {6807#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:44,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {6807#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6807#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:44,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {6807#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6808#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:44,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {6808#(<= main_~i~0 11)} assume true; {6808#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:44,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {6808#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6808#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:44,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {6808#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6809#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:44,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {6809#(<= main_~i~0 12)} assume true; {6809#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:44,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {6809#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6809#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:44,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {6809#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6810#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:44,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {6810#(<= main_~i~0 13)} assume true; {6810#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:44,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {6810#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6810#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:44,085 INFO L273 TraceCheckUtils]: 47: Hoare triple {6810#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6811#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:44,085 INFO L273 TraceCheckUtils]: 48: Hoare triple {6811#(<= main_~i~0 14)} assume true; {6811#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:44,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {6811#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6811#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:44,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {6811#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6812#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:44,087 INFO L273 TraceCheckUtils]: 51: Hoare triple {6812#(<= main_~i~0 15)} assume true; {6812#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:44,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {6812#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6812#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:44,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {6812#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6813#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:44,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {6813#(<= main_~i~0 16)} assume true; {6813#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:44,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {6813#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6813#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:44,090 INFO L273 TraceCheckUtils]: 56: Hoare triple {6813#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6814#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:44,091 INFO L273 TraceCheckUtils]: 57: Hoare triple {6814#(<= main_~i~0 17)} assume true; {6814#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:44,091 INFO L273 TraceCheckUtils]: 58: Hoare triple {6814#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6814#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:44,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {6814#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6815#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:44,092 INFO L273 TraceCheckUtils]: 60: Hoare triple {6815#(<= main_~i~0 18)} assume true; {6815#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:44,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {6815#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6815#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:44,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {6815#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6816#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:44,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {6816#(<= main_~i~0 19)} assume true; {6816#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:44,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {6816#(<= main_~i~0 19)} assume !(~i~0 < 2048); {6796#false} is VALID [2018-11-14 17:32:44,095 INFO L273 TraceCheckUtils]: 65: Hoare triple {6796#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {6796#false} is VALID [2018-11-14 17:32:44,095 INFO L256 TraceCheckUtils]: 66: Hoare triple {6796#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6796#false} is VALID [2018-11-14 17:32:44,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {6796#false} ~cond := #in~cond; {6796#false} is VALID [2018-11-14 17:32:44,096 INFO L273 TraceCheckUtils]: 68: Hoare triple {6796#false} assume ~cond == 0; {6796#false} is VALID [2018-11-14 17:32:44,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {6796#false} assume !false; {6796#false} is VALID [2018-11-14 17:32:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:44,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:44,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:44,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:44,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {6795#true} call ULTIMATE.init(); {6795#true} is VALID [2018-11-14 17:32:44,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {6795#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6795#true} is VALID [2018-11-14 17:32:44,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {6795#true} assume true; {6795#true} is VALID [2018-11-14 17:32:44,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6795#true} {6795#true} #36#return; {6795#true} is VALID [2018-11-14 17:32:44,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {6795#true} call #t~ret4 := main(); {6795#true} is VALID [2018-11-14 17:32:44,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {6795#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6835#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:44,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {6835#(<= main_~i~0 0)} assume true; {6835#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:44,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {6835#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6835#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:44,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {6835#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6798#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:44,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {6798#(<= main_~i~0 1)} assume true; {6798#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:44,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {6798#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6798#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:44,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {6798#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6799#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:44,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {6799#(<= main_~i~0 2)} assume true; {6799#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:44,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {6799#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6799#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:44,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {6799#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6800#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:44,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {6800#(<= main_~i~0 3)} assume true; {6800#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:44,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {6800#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6800#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:44,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {6800#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6801#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:44,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {6801#(<= main_~i~0 4)} assume true; {6801#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:44,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {6801#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6801#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:44,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {6801#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6802#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:44,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {6802#(<= main_~i~0 5)} assume true; {6802#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:44,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {6802#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6802#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:44,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {6802#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6803#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:44,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {6803#(<= main_~i~0 6)} assume true; {6803#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:44,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {6803#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6803#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:44,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {6803#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6804#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:44,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {6804#(<= main_~i~0 7)} assume true; {6804#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:44,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {6804#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6804#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:44,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {6804#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6805#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:44,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {6805#(<= main_~i~0 8)} assume true; {6805#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:44,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {6805#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6805#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:44,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {6805#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6806#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:44,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {6806#(<= main_~i~0 9)} assume true; {6806#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:44,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {6806#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6806#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:44,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {6806#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6807#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:44,364 INFO L273 TraceCheckUtils]: 36: Hoare triple {6807#(<= main_~i~0 10)} assume true; {6807#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:44,365 INFO L273 TraceCheckUtils]: 37: Hoare triple {6807#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6807#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:44,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {6807#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6808#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:44,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {6808#(<= main_~i~0 11)} assume true; {6808#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:44,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {6808#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6808#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:44,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {6808#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6809#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:44,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {6809#(<= main_~i~0 12)} assume true; {6809#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:44,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {6809#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6809#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:44,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {6809#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6810#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:44,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {6810#(<= main_~i~0 13)} assume true; {6810#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:44,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {6810#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6810#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:44,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {6810#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6811#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:44,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {6811#(<= main_~i~0 14)} assume true; {6811#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:44,372 INFO L273 TraceCheckUtils]: 49: Hoare triple {6811#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6811#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:44,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {6811#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6812#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:44,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {6812#(<= main_~i~0 15)} assume true; {6812#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:44,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {6812#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6812#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:44,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {6812#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6813#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:44,375 INFO L273 TraceCheckUtils]: 54: Hoare triple {6813#(<= main_~i~0 16)} assume true; {6813#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:44,376 INFO L273 TraceCheckUtils]: 55: Hoare triple {6813#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6813#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:44,376 INFO L273 TraceCheckUtils]: 56: Hoare triple {6813#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6814#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:44,377 INFO L273 TraceCheckUtils]: 57: Hoare triple {6814#(<= main_~i~0 17)} assume true; {6814#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:44,377 INFO L273 TraceCheckUtils]: 58: Hoare triple {6814#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6814#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:44,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {6814#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6815#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:44,379 INFO L273 TraceCheckUtils]: 60: Hoare triple {6815#(<= main_~i~0 18)} assume true; {6815#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:44,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {6815#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6815#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:44,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {6815#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6816#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:44,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {6816#(<= main_~i~0 19)} assume true; {6816#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:44,381 INFO L273 TraceCheckUtils]: 64: Hoare triple {6816#(<= main_~i~0 19)} assume !(~i~0 < 2048); {6796#false} is VALID [2018-11-14 17:32:44,381 INFO L273 TraceCheckUtils]: 65: Hoare triple {6796#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {6796#false} is VALID [2018-11-14 17:32:44,382 INFO L256 TraceCheckUtils]: 66: Hoare triple {6796#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6796#false} is VALID [2018-11-14 17:32:44,382 INFO L273 TraceCheckUtils]: 67: Hoare triple {6796#false} ~cond := #in~cond; {6796#false} is VALID [2018-11-14 17:32:44,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {6796#false} assume ~cond == 0; {6796#false} is VALID [2018-11-14 17:32:44,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {6796#false} assume !false; {6796#false} is VALID [2018-11-14 17:32:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:44,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:44,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 17:32:44,406 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-14 17:32:44,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:44,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:32:44,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:44,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:32:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:32:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:32:44,476 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 23 states. [2018-11-14 17:32:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:44,884 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-14 17:32:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:32:44,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-14 17:32:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:32:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2018-11-14 17:32:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:32:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2018-11-14 17:32:44,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 81 transitions. [2018-11-14 17:32:45,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:45,830 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:32:45,830 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:32:45,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:32:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:32:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-14 17:32:45,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:45,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-14 17:32:45,853 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-14 17:32:45,853 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-14 17:32:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:45,856 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-14 17:32:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-14 17:32:45,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:45,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:45,857 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-14 17:32:45,857 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-14 17:32:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:45,860 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-14 17:32:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-14 17:32:45,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:45,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:45,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:45,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:32:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-11-14 17:32:45,863 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-11-14 17:32:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:45,863 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-11-14 17:32:45,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:32:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-14 17:32:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 17:32:45,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:45,865 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:45,865 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:45,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash 6773987, now seen corresponding path program 20 times [2018-11-14 17:32:45,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:45,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:45,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:46,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {7388#true} call ULTIMATE.init(); {7388#true} is VALID [2018-11-14 17:32:46,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {7388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7388#true} is VALID [2018-11-14 17:32:46,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {7388#true} assume true; {7388#true} is VALID [2018-11-14 17:32:46,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7388#true} {7388#true} #36#return; {7388#true} is VALID [2018-11-14 17:32:46,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {7388#true} call #t~ret4 := main(); {7388#true} is VALID [2018-11-14 17:32:46,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {7388#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7390#(= main_~i~0 0)} is VALID [2018-11-14 17:32:46,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {7390#(= main_~i~0 0)} assume true; {7390#(= main_~i~0 0)} is VALID [2018-11-14 17:32:46,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {7390#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7390#(= main_~i~0 0)} is VALID [2018-11-14 17:32:46,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {7390#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7391#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:46,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {7391#(<= main_~i~0 1)} assume true; {7391#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:46,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {7391#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7391#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:46,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {7391#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7392#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:46,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {7392#(<= main_~i~0 2)} assume true; {7392#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:46,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {7392#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7392#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:46,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {7392#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7393#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:46,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {7393#(<= main_~i~0 3)} assume true; {7393#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:46,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {7393#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7393#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:46,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {7393#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7394#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:46,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {7394#(<= main_~i~0 4)} assume true; {7394#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:46,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {7394#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7394#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:46,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {7394#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7395#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:46,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {7395#(<= main_~i~0 5)} assume true; {7395#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:46,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {7395#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7395#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:46,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {7395#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7396#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:46,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {7396#(<= main_~i~0 6)} assume true; {7396#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:46,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {7396#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7396#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:46,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {7396#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7397#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:46,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {7397#(<= main_~i~0 7)} assume true; {7397#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:46,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {7397#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7397#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:46,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {7397#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7398#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:46,897 INFO L273 TraceCheckUtils]: 30: Hoare triple {7398#(<= main_~i~0 8)} assume true; {7398#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:46,898 INFO L273 TraceCheckUtils]: 31: Hoare triple {7398#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7398#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:46,898 INFO L273 TraceCheckUtils]: 32: Hoare triple {7398#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7399#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:46,899 INFO L273 TraceCheckUtils]: 33: Hoare triple {7399#(<= main_~i~0 9)} assume true; {7399#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:46,899 INFO L273 TraceCheckUtils]: 34: Hoare triple {7399#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7399#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:46,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {7399#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7400#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:46,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {7400#(<= main_~i~0 10)} assume true; {7400#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:46,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {7400#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7400#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:46,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {7400#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7401#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:46,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {7401#(<= main_~i~0 11)} assume true; {7401#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:46,903 INFO L273 TraceCheckUtils]: 40: Hoare triple {7401#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7401#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:46,904 INFO L273 TraceCheckUtils]: 41: Hoare triple {7401#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7402#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:46,904 INFO L273 TraceCheckUtils]: 42: Hoare triple {7402#(<= main_~i~0 12)} assume true; {7402#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:46,905 INFO L273 TraceCheckUtils]: 43: Hoare triple {7402#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7402#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:46,905 INFO L273 TraceCheckUtils]: 44: Hoare triple {7402#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7403#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:46,906 INFO L273 TraceCheckUtils]: 45: Hoare triple {7403#(<= main_~i~0 13)} assume true; {7403#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:46,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {7403#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7403#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:46,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {7403#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7404#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:46,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {7404#(<= main_~i~0 14)} assume true; {7404#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:46,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {7404#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7404#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:46,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {7404#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7405#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:46,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {7405#(<= main_~i~0 15)} assume true; {7405#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:46,910 INFO L273 TraceCheckUtils]: 52: Hoare triple {7405#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7405#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:46,911 INFO L273 TraceCheckUtils]: 53: Hoare triple {7405#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7406#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:46,911 INFO L273 TraceCheckUtils]: 54: Hoare triple {7406#(<= main_~i~0 16)} assume true; {7406#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:46,912 INFO L273 TraceCheckUtils]: 55: Hoare triple {7406#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7406#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:46,912 INFO L273 TraceCheckUtils]: 56: Hoare triple {7406#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7407#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:46,913 INFO L273 TraceCheckUtils]: 57: Hoare triple {7407#(<= main_~i~0 17)} assume true; {7407#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:46,913 INFO L273 TraceCheckUtils]: 58: Hoare triple {7407#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7407#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:46,914 INFO L273 TraceCheckUtils]: 59: Hoare triple {7407#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7408#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:46,915 INFO L273 TraceCheckUtils]: 60: Hoare triple {7408#(<= main_~i~0 18)} assume true; {7408#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:46,915 INFO L273 TraceCheckUtils]: 61: Hoare triple {7408#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7408#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:46,916 INFO L273 TraceCheckUtils]: 62: Hoare triple {7408#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7409#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:46,916 INFO L273 TraceCheckUtils]: 63: Hoare triple {7409#(<= main_~i~0 19)} assume true; {7409#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:46,917 INFO L273 TraceCheckUtils]: 64: Hoare triple {7409#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7409#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:46,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {7409#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7410#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:46,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {7410#(<= main_~i~0 20)} assume true; {7410#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:46,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {7410#(<= main_~i~0 20)} assume !(~i~0 < 2048); {7389#false} is VALID [2018-11-14 17:32:46,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {7389#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {7389#false} is VALID [2018-11-14 17:32:46,919 INFO L256 TraceCheckUtils]: 69: Hoare triple {7389#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7389#false} is VALID [2018-11-14 17:32:46,920 INFO L273 TraceCheckUtils]: 70: Hoare triple {7389#false} ~cond := #in~cond; {7389#false} is VALID [2018-11-14 17:32:46,920 INFO L273 TraceCheckUtils]: 71: Hoare triple {7389#false} assume ~cond == 0; {7389#false} is VALID [2018-11-14 17:32:46,920 INFO L273 TraceCheckUtils]: 72: Hoare triple {7389#false} assume !false; {7389#false} is VALID [2018-11-14 17:32:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:46,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:46,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:46,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:46,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:46,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:47,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {7388#true} call ULTIMATE.init(); {7388#true} is VALID [2018-11-14 17:32:47,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {7388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7388#true} is VALID [2018-11-14 17:32:47,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {7388#true} assume true; {7388#true} is VALID [2018-11-14 17:32:47,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7388#true} {7388#true} #36#return; {7388#true} is VALID [2018-11-14 17:32:47,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {7388#true} call #t~ret4 := main(); {7388#true} is VALID [2018-11-14 17:32:47,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {7388#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7429#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:47,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {7429#(<= main_~i~0 0)} assume true; {7429#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:47,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {7429#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7429#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:47,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {7429#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7391#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:47,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {7391#(<= main_~i~0 1)} assume true; {7391#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:47,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {7391#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7391#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:47,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {7391#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7392#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:47,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {7392#(<= main_~i~0 2)} assume true; {7392#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:47,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {7392#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7392#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:47,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {7392#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7393#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:47,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {7393#(<= main_~i~0 3)} assume true; {7393#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:47,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {7393#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7393#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:47,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {7393#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7394#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:47,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {7394#(<= main_~i~0 4)} assume true; {7394#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:47,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {7394#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7394#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:47,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {7394#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7395#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:47,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {7395#(<= main_~i~0 5)} assume true; {7395#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:47,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {7395#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7395#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:47,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {7395#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7396#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:47,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {7396#(<= main_~i~0 6)} assume true; {7396#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:47,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {7396#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7396#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:47,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {7396#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7397#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:47,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {7397#(<= main_~i~0 7)} assume true; {7397#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:47,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {7397#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7397#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:47,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {7397#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7398#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:47,320 INFO L273 TraceCheckUtils]: 30: Hoare triple {7398#(<= main_~i~0 8)} assume true; {7398#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:47,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {7398#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7398#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:47,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {7398#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7399#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:47,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {7399#(<= main_~i~0 9)} assume true; {7399#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:47,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {7399#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7399#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:47,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {7399#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7400#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:47,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {7400#(<= main_~i~0 10)} assume true; {7400#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:47,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {7400#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7400#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:47,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {7400#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7401#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:47,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {7401#(<= main_~i~0 11)} assume true; {7401#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:47,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {7401#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7401#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:47,326 INFO L273 TraceCheckUtils]: 41: Hoare triple {7401#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7402#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:47,326 INFO L273 TraceCheckUtils]: 42: Hoare triple {7402#(<= main_~i~0 12)} assume true; {7402#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:47,327 INFO L273 TraceCheckUtils]: 43: Hoare triple {7402#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7402#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:47,327 INFO L273 TraceCheckUtils]: 44: Hoare triple {7402#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7403#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:47,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {7403#(<= main_~i~0 13)} assume true; {7403#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:47,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {7403#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7403#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:47,329 INFO L273 TraceCheckUtils]: 47: Hoare triple {7403#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7404#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:47,329 INFO L273 TraceCheckUtils]: 48: Hoare triple {7404#(<= main_~i~0 14)} assume true; {7404#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:47,330 INFO L273 TraceCheckUtils]: 49: Hoare triple {7404#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7404#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:47,331 INFO L273 TraceCheckUtils]: 50: Hoare triple {7404#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7405#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:47,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {7405#(<= main_~i~0 15)} assume true; {7405#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:47,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {7405#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7405#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:47,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {7405#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7406#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:47,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {7406#(<= main_~i~0 16)} assume true; {7406#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:47,333 INFO L273 TraceCheckUtils]: 55: Hoare triple {7406#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7406#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:47,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {7406#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7407#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:47,334 INFO L273 TraceCheckUtils]: 57: Hoare triple {7407#(<= main_~i~0 17)} assume true; {7407#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:47,335 INFO L273 TraceCheckUtils]: 58: Hoare triple {7407#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7407#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:47,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {7407#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7408#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:47,336 INFO L273 TraceCheckUtils]: 60: Hoare triple {7408#(<= main_~i~0 18)} assume true; {7408#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:47,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {7408#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7408#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:47,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {7408#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7409#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:47,338 INFO L273 TraceCheckUtils]: 63: Hoare triple {7409#(<= main_~i~0 19)} assume true; {7409#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:47,338 INFO L273 TraceCheckUtils]: 64: Hoare triple {7409#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7409#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:47,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {7409#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7410#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:47,339 INFO L273 TraceCheckUtils]: 66: Hoare triple {7410#(<= main_~i~0 20)} assume true; {7410#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:47,340 INFO L273 TraceCheckUtils]: 67: Hoare triple {7410#(<= main_~i~0 20)} assume !(~i~0 < 2048); {7389#false} is VALID [2018-11-14 17:32:47,340 INFO L273 TraceCheckUtils]: 68: Hoare triple {7389#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {7389#false} is VALID [2018-11-14 17:32:47,340 INFO L256 TraceCheckUtils]: 69: Hoare triple {7389#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7389#false} is VALID [2018-11-14 17:32:47,341 INFO L273 TraceCheckUtils]: 70: Hoare triple {7389#false} ~cond := #in~cond; {7389#false} is VALID [2018-11-14 17:32:47,341 INFO L273 TraceCheckUtils]: 71: Hoare triple {7389#false} assume ~cond == 0; {7389#false} is VALID [2018-11-14 17:32:47,341 INFO L273 TraceCheckUtils]: 72: Hoare triple {7389#false} assume !false; {7389#false} is VALID [2018-11-14 17:32:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:47,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:47,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 17:32:47,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-14 17:32:47,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:47,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:32:47,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:47,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:32:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:32:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:32:47,434 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 24 states. [2018-11-14 17:32:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:47,741 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-14 17:32:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:32:47,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-14 17:32:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:32:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 84 transitions. [2018-11-14 17:32:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:32:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 84 transitions. [2018-11-14 17:32:47,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 84 transitions. [2018-11-14 17:32:48,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:48,195 INFO L225 Difference]: With dead ends: 84 [2018-11-14 17:32:48,196 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:32:48,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:32:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:32:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 17:32:48,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:48,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 17:32:48,247 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 17:32:48,247 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 17:32:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:48,249 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-14 17:32:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-14 17:32:48,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:48,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:48,249 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 17:32:48,250 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 17:32:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:48,251 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-14 17:32:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-14 17:32:48,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:48,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:48,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:48,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:32:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-14 17:32:48,254 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-11-14 17:32:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:48,254 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-14 17:32:48,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:32:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-14 17:32:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:32:48,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:48,255 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:48,255 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:48,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1034136154, now seen corresponding path program 21 times [2018-11-14 17:32:48,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:48,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:48,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:48,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {8005#true} call ULTIMATE.init(); {8005#true} is VALID [2018-11-14 17:32:48,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {8005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8005#true} is VALID [2018-11-14 17:32:48,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {8005#true} assume true; {8005#true} is VALID [2018-11-14 17:32:48,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8005#true} {8005#true} #36#return; {8005#true} is VALID [2018-11-14 17:32:48,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {8005#true} call #t~ret4 := main(); {8005#true} is VALID [2018-11-14 17:32:48,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {8005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8007#(= main_~i~0 0)} is VALID [2018-11-14 17:32:48,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {8007#(= main_~i~0 0)} assume true; {8007#(= main_~i~0 0)} is VALID [2018-11-14 17:32:48,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {8007#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8007#(= main_~i~0 0)} is VALID [2018-11-14 17:32:48,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {8007#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8008#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:48,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {8008#(<= main_~i~0 1)} assume true; {8008#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:48,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {8008#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8008#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:48,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {8008#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8009#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:48,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {8009#(<= main_~i~0 2)} assume true; {8009#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:48,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {8009#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8009#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:48,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {8009#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8010#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:48,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {8010#(<= main_~i~0 3)} assume true; {8010#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:48,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {8010#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8010#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:48,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {8010#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8011#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:48,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {8011#(<= main_~i~0 4)} assume true; {8011#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:48,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {8011#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8011#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:48,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {8011#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8012#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:48,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {8012#(<= main_~i~0 5)} assume true; {8012#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:48,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {8012#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8012#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:48,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {8012#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8013#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:48,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {8013#(<= main_~i~0 6)} assume true; {8013#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:48,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {8013#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8013#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:48,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {8013#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8014#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:48,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {8014#(<= main_~i~0 7)} assume true; {8014#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:48,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {8014#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8014#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:48,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {8014#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8015#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:48,652 INFO L273 TraceCheckUtils]: 30: Hoare triple {8015#(<= main_~i~0 8)} assume true; {8015#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:48,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {8015#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8015#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:48,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {8015#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8016#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:48,654 INFO L273 TraceCheckUtils]: 33: Hoare triple {8016#(<= main_~i~0 9)} assume true; {8016#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:48,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {8016#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8016#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:48,655 INFO L273 TraceCheckUtils]: 35: Hoare triple {8016#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8017#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:48,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {8017#(<= main_~i~0 10)} assume true; {8017#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:48,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {8017#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8017#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:48,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {8017#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8018#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:48,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {8018#(<= main_~i~0 11)} assume true; {8018#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:48,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {8018#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8018#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:48,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {8018#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8019#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:48,659 INFO L273 TraceCheckUtils]: 42: Hoare triple {8019#(<= main_~i~0 12)} assume true; {8019#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:48,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {8019#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8019#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:48,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {8019#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8020#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:48,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {8020#(<= main_~i~0 13)} assume true; {8020#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:48,662 INFO L273 TraceCheckUtils]: 46: Hoare triple {8020#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8020#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:48,662 INFO L273 TraceCheckUtils]: 47: Hoare triple {8020#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8021#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:48,663 INFO L273 TraceCheckUtils]: 48: Hoare triple {8021#(<= main_~i~0 14)} assume true; {8021#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:48,663 INFO L273 TraceCheckUtils]: 49: Hoare triple {8021#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8021#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:48,664 INFO L273 TraceCheckUtils]: 50: Hoare triple {8021#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8022#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:48,665 INFO L273 TraceCheckUtils]: 51: Hoare triple {8022#(<= main_~i~0 15)} assume true; {8022#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:48,665 INFO L273 TraceCheckUtils]: 52: Hoare triple {8022#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8022#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:48,666 INFO L273 TraceCheckUtils]: 53: Hoare triple {8022#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8023#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:48,667 INFO L273 TraceCheckUtils]: 54: Hoare triple {8023#(<= main_~i~0 16)} assume true; {8023#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:48,667 INFO L273 TraceCheckUtils]: 55: Hoare triple {8023#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8023#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:48,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {8023#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8024#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:48,668 INFO L273 TraceCheckUtils]: 57: Hoare triple {8024#(<= main_~i~0 17)} assume true; {8024#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:48,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {8024#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8024#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:48,670 INFO L273 TraceCheckUtils]: 59: Hoare triple {8024#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8025#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:48,670 INFO L273 TraceCheckUtils]: 60: Hoare triple {8025#(<= main_~i~0 18)} assume true; {8025#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:48,671 INFO L273 TraceCheckUtils]: 61: Hoare triple {8025#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8025#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:48,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {8025#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8026#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:48,672 INFO L273 TraceCheckUtils]: 63: Hoare triple {8026#(<= main_~i~0 19)} assume true; {8026#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:48,673 INFO L273 TraceCheckUtils]: 64: Hoare triple {8026#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8026#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:48,673 INFO L273 TraceCheckUtils]: 65: Hoare triple {8026#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8027#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:48,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {8027#(<= main_~i~0 20)} assume true; {8027#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:48,674 INFO L273 TraceCheckUtils]: 67: Hoare triple {8027#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8027#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:48,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {8027#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8028#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:48,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {8028#(<= main_~i~0 21)} assume true; {8028#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:48,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {8028#(<= main_~i~0 21)} assume !(~i~0 < 2048); {8006#false} is VALID [2018-11-14 17:32:48,677 INFO L273 TraceCheckUtils]: 71: Hoare triple {8006#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {8006#false} is VALID [2018-11-14 17:32:48,677 INFO L256 TraceCheckUtils]: 72: Hoare triple {8006#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8006#false} is VALID [2018-11-14 17:32:48,677 INFO L273 TraceCheckUtils]: 73: Hoare triple {8006#false} ~cond := #in~cond; {8006#false} is VALID [2018-11-14 17:32:48,677 INFO L273 TraceCheckUtils]: 74: Hoare triple {8006#false} assume ~cond == 0; {8006#false} is VALID [2018-11-14 17:32:48,678 INFO L273 TraceCheckUtils]: 75: Hoare triple {8006#false} assume !false; {8006#false} is VALID [2018-11-14 17:32:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:48,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:48,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:48,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:32:50,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 17:32:50,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:50,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:51,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {8005#true} call ULTIMATE.init(); {8005#true} is VALID [2018-11-14 17:32:51,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {8005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8005#true} is VALID [2018-11-14 17:32:51,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {8005#true} assume true; {8005#true} is VALID [2018-11-14 17:32:51,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8005#true} {8005#true} #36#return; {8005#true} is VALID [2018-11-14 17:32:51,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {8005#true} call #t~ret4 := main(); {8005#true} is VALID [2018-11-14 17:32:51,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {8005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8047#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:51,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {8047#(<= main_~i~0 0)} assume true; {8047#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:51,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {8047#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8047#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:51,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {8047#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8008#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:51,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {8008#(<= main_~i~0 1)} assume true; {8008#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:51,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {8008#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8008#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:51,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {8008#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8009#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:51,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {8009#(<= main_~i~0 2)} assume true; {8009#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:51,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {8009#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8009#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:51,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {8009#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8010#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:51,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {8010#(<= main_~i~0 3)} assume true; {8010#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:51,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {8010#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8010#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:51,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {8010#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8011#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:51,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {8011#(<= main_~i~0 4)} assume true; {8011#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:51,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {8011#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8011#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:51,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {8011#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8012#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:51,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {8012#(<= main_~i~0 5)} assume true; {8012#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:51,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {8012#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8012#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:51,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {8012#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8013#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:51,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {8013#(<= main_~i~0 6)} assume true; {8013#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:51,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {8013#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8013#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:51,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {8013#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8014#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:51,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {8014#(<= main_~i~0 7)} assume true; {8014#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:51,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {8014#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8014#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:51,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {8014#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8015#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:51,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {8015#(<= main_~i~0 8)} assume true; {8015#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:51,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {8015#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8015#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:51,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {8015#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8016#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:51,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {8016#(<= main_~i~0 9)} assume true; {8016#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:51,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {8016#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8016#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:51,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {8016#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8017#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:51,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {8017#(<= main_~i~0 10)} assume true; {8017#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:51,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {8017#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8017#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:51,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {8017#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8018#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:51,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {8018#(<= main_~i~0 11)} assume true; {8018#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:51,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {8018#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8018#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:51,168 INFO L273 TraceCheckUtils]: 41: Hoare triple {8018#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8019#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:51,168 INFO L273 TraceCheckUtils]: 42: Hoare triple {8019#(<= main_~i~0 12)} assume true; {8019#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:51,169 INFO L273 TraceCheckUtils]: 43: Hoare triple {8019#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8019#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:51,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {8019#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8020#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:51,170 INFO L273 TraceCheckUtils]: 45: Hoare triple {8020#(<= main_~i~0 13)} assume true; {8020#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:51,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {8020#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8020#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:51,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {8020#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8021#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:51,172 INFO L273 TraceCheckUtils]: 48: Hoare triple {8021#(<= main_~i~0 14)} assume true; {8021#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:51,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {8021#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8021#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:51,173 INFO L273 TraceCheckUtils]: 50: Hoare triple {8021#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8022#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:51,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {8022#(<= main_~i~0 15)} assume true; {8022#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:51,174 INFO L273 TraceCheckUtils]: 52: Hoare triple {8022#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8022#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:51,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {8022#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8023#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:51,176 INFO L273 TraceCheckUtils]: 54: Hoare triple {8023#(<= main_~i~0 16)} assume true; {8023#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:51,176 INFO L273 TraceCheckUtils]: 55: Hoare triple {8023#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8023#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:51,177 INFO L273 TraceCheckUtils]: 56: Hoare triple {8023#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8024#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:51,177 INFO L273 TraceCheckUtils]: 57: Hoare triple {8024#(<= main_~i~0 17)} assume true; {8024#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:51,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {8024#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8024#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:51,179 INFO L273 TraceCheckUtils]: 59: Hoare triple {8024#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8025#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:51,179 INFO L273 TraceCheckUtils]: 60: Hoare triple {8025#(<= main_~i~0 18)} assume true; {8025#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:51,180 INFO L273 TraceCheckUtils]: 61: Hoare triple {8025#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8025#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:51,181 INFO L273 TraceCheckUtils]: 62: Hoare triple {8025#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8026#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:51,181 INFO L273 TraceCheckUtils]: 63: Hoare triple {8026#(<= main_~i~0 19)} assume true; {8026#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:51,182 INFO L273 TraceCheckUtils]: 64: Hoare triple {8026#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8026#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:51,182 INFO L273 TraceCheckUtils]: 65: Hoare triple {8026#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8027#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:51,183 INFO L273 TraceCheckUtils]: 66: Hoare triple {8027#(<= main_~i~0 20)} assume true; {8027#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:51,183 INFO L273 TraceCheckUtils]: 67: Hoare triple {8027#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8027#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:51,184 INFO L273 TraceCheckUtils]: 68: Hoare triple {8027#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8028#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:51,185 INFO L273 TraceCheckUtils]: 69: Hoare triple {8028#(<= main_~i~0 21)} assume true; {8028#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:51,185 INFO L273 TraceCheckUtils]: 70: Hoare triple {8028#(<= main_~i~0 21)} assume !(~i~0 < 2048); {8006#false} is VALID [2018-11-14 17:32:51,186 INFO L273 TraceCheckUtils]: 71: Hoare triple {8006#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {8006#false} is VALID [2018-11-14 17:32:51,186 INFO L256 TraceCheckUtils]: 72: Hoare triple {8006#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8006#false} is VALID [2018-11-14 17:32:51,186 INFO L273 TraceCheckUtils]: 73: Hoare triple {8006#false} ~cond := #in~cond; {8006#false} is VALID [2018-11-14 17:32:51,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {8006#false} assume ~cond == 0; {8006#false} is VALID [2018-11-14 17:32:51,187 INFO L273 TraceCheckUtils]: 75: Hoare triple {8006#false} assume !false; {8006#false} is VALID [2018-11-14 17:32:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:51,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:51,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 17:32:51,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-14 17:32:51,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:51,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:32:51,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:51,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:32:51,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:32:51,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:32:51,293 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 25 states. [2018-11-14 17:32:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:51,623 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-14 17:32:51,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:32:51,624 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-14 17:32:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:32:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 87 transitions. [2018-11-14 17:32:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:32:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 87 transitions. [2018-11-14 17:32:51,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 87 transitions. [2018-11-14 17:32:51,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:51,709 INFO L225 Difference]: With dead ends: 87 [2018-11-14 17:32:51,709 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 17:32:51,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:32:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 17:32:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-14 17:32:51,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:51,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-14 17:32:51,731 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-14 17:32:51,731 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-14 17:32:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:51,732 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-14 17:32:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-14 17:32:51,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:51,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:51,733 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-14 17:32:51,733 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-14 17:32:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:51,735 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-14 17:32:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-14 17:32:51,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:51,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:51,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:51,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 17:32:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-11-14 17:32:51,737 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-11-14 17:32:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:51,737 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-11-14 17:32:51,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:32:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-14 17:32:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 17:32:51,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:51,738 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:51,739 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:51,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1243501955, now seen corresponding path program 22 times [2018-11-14 17:32:51,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:51,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:51,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:52,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {8646#true} call ULTIMATE.init(); {8646#true} is VALID [2018-11-14 17:32:52,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {8646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8646#true} is VALID [2018-11-14 17:32:52,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {8646#true} assume true; {8646#true} is VALID [2018-11-14 17:32:52,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8646#true} {8646#true} #36#return; {8646#true} is VALID [2018-11-14 17:32:52,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {8646#true} call #t~ret4 := main(); {8646#true} is VALID [2018-11-14 17:32:52,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {8646#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8648#(= main_~i~0 0)} is VALID [2018-11-14 17:32:52,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {8648#(= main_~i~0 0)} assume true; {8648#(= main_~i~0 0)} is VALID [2018-11-14 17:32:52,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {8648#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8648#(= main_~i~0 0)} is VALID [2018-11-14 17:32:52,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {8648#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8649#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:52,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {8649#(<= main_~i~0 1)} assume true; {8649#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:52,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {8649#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8649#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:52,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {8649#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8650#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:52,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {8650#(<= main_~i~0 2)} assume true; {8650#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:52,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {8650#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8650#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:52,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {8650#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8651#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:52,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {8651#(<= main_~i~0 3)} assume true; {8651#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:52,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {8651#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8651#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:52,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {8651#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8652#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:52,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {8652#(<= main_~i~0 4)} assume true; {8652#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:52,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {8652#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8652#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:52,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {8652#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8653#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:52,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {8653#(<= main_~i~0 5)} assume true; {8653#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:52,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {8653#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8653#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:52,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {8653#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8654#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:52,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {8654#(<= main_~i~0 6)} assume true; {8654#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:52,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {8654#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8654#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:52,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {8654#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8655#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:52,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {8655#(<= main_~i~0 7)} assume true; {8655#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:52,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {8655#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8655#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:52,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {8655#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8656#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:52,212 INFO L273 TraceCheckUtils]: 30: Hoare triple {8656#(<= main_~i~0 8)} assume true; {8656#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:52,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {8656#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8656#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:52,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {8656#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8657#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:52,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {8657#(<= main_~i~0 9)} assume true; {8657#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:52,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {8657#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8657#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:52,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {8657#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8658#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:52,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {8658#(<= main_~i~0 10)} assume true; {8658#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:52,216 INFO L273 TraceCheckUtils]: 37: Hoare triple {8658#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8658#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:52,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {8658#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8659#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:52,218 INFO L273 TraceCheckUtils]: 39: Hoare triple {8659#(<= main_~i~0 11)} assume true; {8659#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:52,218 INFO L273 TraceCheckUtils]: 40: Hoare triple {8659#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8659#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:52,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {8659#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8660#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:52,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {8660#(<= main_~i~0 12)} assume true; {8660#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:52,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {8660#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8660#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:52,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {8660#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8661#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:52,221 INFO L273 TraceCheckUtils]: 45: Hoare triple {8661#(<= main_~i~0 13)} assume true; {8661#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:52,222 INFO L273 TraceCheckUtils]: 46: Hoare triple {8661#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8661#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:52,222 INFO L273 TraceCheckUtils]: 47: Hoare triple {8661#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8662#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:52,223 INFO L273 TraceCheckUtils]: 48: Hoare triple {8662#(<= main_~i~0 14)} assume true; {8662#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:52,223 INFO L273 TraceCheckUtils]: 49: Hoare triple {8662#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8662#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:52,224 INFO L273 TraceCheckUtils]: 50: Hoare triple {8662#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8663#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:52,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {8663#(<= main_~i~0 15)} assume true; {8663#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:52,225 INFO L273 TraceCheckUtils]: 52: Hoare triple {8663#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8663#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:52,226 INFO L273 TraceCheckUtils]: 53: Hoare triple {8663#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8664#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:52,226 INFO L273 TraceCheckUtils]: 54: Hoare triple {8664#(<= main_~i~0 16)} assume true; {8664#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:52,227 INFO L273 TraceCheckUtils]: 55: Hoare triple {8664#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8664#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:52,228 INFO L273 TraceCheckUtils]: 56: Hoare triple {8664#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8665#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:52,228 INFO L273 TraceCheckUtils]: 57: Hoare triple {8665#(<= main_~i~0 17)} assume true; {8665#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:52,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {8665#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8665#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:52,229 INFO L273 TraceCheckUtils]: 59: Hoare triple {8665#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8666#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:52,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {8666#(<= main_~i~0 18)} assume true; {8666#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:52,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {8666#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8666#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:52,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {8666#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8667#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:52,232 INFO L273 TraceCheckUtils]: 63: Hoare triple {8667#(<= main_~i~0 19)} assume true; {8667#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:52,232 INFO L273 TraceCheckUtils]: 64: Hoare triple {8667#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8667#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:52,233 INFO L273 TraceCheckUtils]: 65: Hoare triple {8667#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8668#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:52,234 INFO L273 TraceCheckUtils]: 66: Hoare triple {8668#(<= main_~i~0 20)} assume true; {8668#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:52,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {8668#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8668#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:52,235 INFO L273 TraceCheckUtils]: 68: Hoare triple {8668#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8669#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:52,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {8669#(<= main_~i~0 21)} assume true; {8669#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:52,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {8669#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8669#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:52,237 INFO L273 TraceCheckUtils]: 71: Hoare triple {8669#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8670#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:52,237 INFO L273 TraceCheckUtils]: 72: Hoare triple {8670#(<= main_~i~0 22)} assume true; {8670#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:52,238 INFO L273 TraceCheckUtils]: 73: Hoare triple {8670#(<= main_~i~0 22)} assume !(~i~0 < 2048); {8647#false} is VALID [2018-11-14 17:32:52,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {8647#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {8647#false} is VALID [2018-11-14 17:32:52,238 INFO L256 TraceCheckUtils]: 75: Hoare triple {8647#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8647#false} is VALID [2018-11-14 17:32:52,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {8647#false} ~cond := #in~cond; {8647#false} is VALID [2018-11-14 17:32:52,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {8647#false} assume ~cond == 0; {8647#false} is VALID [2018-11-14 17:32:52,239 INFO L273 TraceCheckUtils]: 78: Hoare triple {8647#false} assume !false; {8647#false} is VALID [2018-11-14 17:32:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:52,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:52,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:52,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:32:52,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:32:52,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:52,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:52,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {8646#true} call ULTIMATE.init(); {8646#true} is VALID [2018-11-14 17:32:52,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {8646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8646#true} is VALID [2018-11-14 17:32:52,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {8646#true} assume true; {8646#true} is VALID [2018-11-14 17:32:52,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8646#true} {8646#true} #36#return; {8646#true} is VALID [2018-11-14 17:32:52,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {8646#true} call #t~ret4 := main(); {8646#true} is VALID [2018-11-14 17:32:52,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {8646#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8689#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:52,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {8689#(<= main_~i~0 0)} assume true; {8689#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:52,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {8689#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8689#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:52,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {8689#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8649#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:52,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {8649#(<= main_~i~0 1)} assume true; {8649#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:52,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {8649#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8649#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:52,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {8649#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8650#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:52,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {8650#(<= main_~i~0 2)} assume true; {8650#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:52,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {8650#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8650#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:52,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {8650#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8651#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:52,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {8651#(<= main_~i~0 3)} assume true; {8651#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:52,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {8651#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8651#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:52,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {8651#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8652#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:52,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {8652#(<= main_~i~0 4)} assume true; {8652#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:52,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {8652#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8652#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:52,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {8652#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8653#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:52,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {8653#(<= main_~i~0 5)} assume true; {8653#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:52,534 INFO L273 TraceCheckUtils]: 22: Hoare triple {8653#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8653#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:52,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {8653#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8654#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:52,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {8654#(<= main_~i~0 6)} assume true; {8654#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:52,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {8654#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8654#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:52,537 INFO L273 TraceCheckUtils]: 26: Hoare triple {8654#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8655#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:52,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {8655#(<= main_~i~0 7)} assume true; {8655#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:52,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {8655#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8655#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:52,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {8655#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8656#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:52,539 INFO L273 TraceCheckUtils]: 30: Hoare triple {8656#(<= main_~i~0 8)} assume true; {8656#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:52,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {8656#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8656#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:52,540 INFO L273 TraceCheckUtils]: 32: Hoare triple {8656#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8657#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:52,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {8657#(<= main_~i~0 9)} assume true; {8657#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:52,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {8657#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8657#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:52,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {8657#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8658#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:52,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {8658#(<= main_~i~0 10)} assume true; {8658#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:52,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {8658#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8658#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:52,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {8658#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8659#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:52,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {8659#(<= main_~i~0 11)} assume true; {8659#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:52,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {8659#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8659#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:52,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {8659#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8660#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:52,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {8660#(<= main_~i~0 12)} assume true; {8660#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:52,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {8660#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8660#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:52,547 INFO L273 TraceCheckUtils]: 44: Hoare triple {8660#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8661#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:52,548 INFO L273 TraceCheckUtils]: 45: Hoare triple {8661#(<= main_~i~0 13)} assume true; {8661#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:52,548 INFO L273 TraceCheckUtils]: 46: Hoare triple {8661#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8661#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:52,549 INFO L273 TraceCheckUtils]: 47: Hoare triple {8661#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8662#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:52,550 INFO L273 TraceCheckUtils]: 48: Hoare triple {8662#(<= main_~i~0 14)} assume true; {8662#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:52,550 INFO L273 TraceCheckUtils]: 49: Hoare triple {8662#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8662#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:52,551 INFO L273 TraceCheckUtils]: 50: Hoare triple {8662#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8663#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:52,551 INFO L273 TraceCheckUtils]: 51: Hoare triple {8663#(<= main_~i~0 15)} assume true; {8663#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:52,552 INFO L273 TraceCheckUtils]: 52: Hoare triple {8663#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8663#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:52,553 INFO L273 TraceCheckUtils]: 53: Hoare triple {8663#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8664#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:52,553 INFO L273 TraceCheckUtils]: 54: Hoare triple {8664#(<= main_~i~0 16)} assume true; {8664#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:52,554 INFO L273 TraceCheckUtils]: 55: Hoare triple {8664#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8664#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:52,554 INFO L273 TraceCheckUtils]: 56: Hoare triple {8664#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8665#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:52,555 INFO L273 TraceCheckUtils]: 57: Hoare triple {8665#(<= main_~i~0 17)} assume true; {8665#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:52,556 INFO L273 TraceCheckUtils]: 58: Hoare triple {8665#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8665#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:52,556 INFO L273 TraceCheckUtils]: 59: Hoare triple {8665#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8666#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:52,557 INFO L273 TraceCheckUtils]: 60: Hoare triple {8666#(<= main_~i~0 18)} assume true; {8666#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:52,557 INFO L273 TraceCheckUtils]: 61: Hoare triple {8666#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8666#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:52,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {8666#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8667#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:52,559 INFO L273 TraceCheckUtils]: 63: Hoare triple {8667#(<= main_~i~0 19)} assume true; {8667#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:52,559 INFO L273 TraceCheckUtils]: 64: Hoare triple {8667#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8667#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:52,560 INFO L273 TraceCheckUtils]: 65: Hoare triple {8667#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8668#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:52,560 INFO L273 TraceCheckUtils]: 66: Hoare triple {8668#(<= main_~i~0 20)} assume true; {8668#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:52,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {8668#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8668#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:52,562 INFO L273 TraceCheckUtils]: 68: Hoare triple {8668#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8669#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:52,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {8669#(<= main_~i~0 21)} assume true; {8669#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:52,563 INFO L273 TraceCheckUtils]: 70: Hoare triple {8669#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8669#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:52,563 INFO L273 TraceCheckUtils]: 71: Hoare triple {8669#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8670#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:52,564 INFO L273 TraceCheckUtils]: 72: Hoare triple {8670#(<= main_~i~0 22)} assume true; {8670#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:52,565 INFO L273 TraceCheckUtils]: 73: Hoare triple {8670#(<= main_~i~0 22)} assume !(~i~0 < 2048); {8647#false} is VALID [2018-11-14 17:32:52,565 INFO L273 TraceCheckUtils]: 74: Hoare triple {8647#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {8647#false} is VALID [2018-11-14 17:32:52,565 INFO L256 TraceCheckUtils]: 75: Hoare triple {8647#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8647#false} is VALID [2018-11-14 17:32:52,565 INFO L273 TraceCheckUtils]: 76: Hoare triple {8647#false} ~cond := #in~cond; {8647#false} is VALID [2018-11-14 17:32:52,566 INFO L273 TraceCheckUtils]: 77: Hoare triple {8647#false} assume ~cond == 0; {8647#false} is VALID [2018-11-14 17:32:52,566 INFO L273 TraceCheckUtils]: 78: Hoare triple {8647#false} assume !false; {8647#false} is VALID [2018-11-14 17:32:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:52,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:52,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 17:32:52,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-14 17:32:52,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:52,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:32:52,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:52,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:32:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:32:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:32:52,671 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-11-14 17:32:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:53,048 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-14 17:32:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:32:53,049 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-14 17:32:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:32:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 90 transitions. [2018-11-14 17:32:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:32:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 90 transitions. [2018-11-14 17:32:53,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 90 transitions. [2018-11-14 17:32:53,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:53,137 INFO L225 Difference]: With dead ends: 90 [2018-11-14 17:32:53,137 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 17:32:53,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:32:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 17:32:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-14 17:32:53,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:53,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-14 17:32:53,159 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-14 17:32:53,159 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-14 17:32:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:53,161 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-14 17:32:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-14 17:32:53,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:53,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:53,162 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-14 17:32:53,162 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-14 17:32:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:53,163 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-14 17:32:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-14 17:32:53,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:53,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:53,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:53,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 17:32:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-14 17:32:53,165 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-11-14 17:32:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:53,166 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-14 17:32:53,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:32:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-14 17:32:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 17:32:53,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:53,167 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:53,167 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:53,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:53,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2127401542, now seen corresponding path program 23 times [2018-11-14 17:32:53,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:53,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:53,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:53,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:53,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {9311#true} call ULTIMATE.init(); {9311#true} is VALID [2018-11-14 17:32:53,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {9311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9311#true} is VALID [2018-11-14 17:32:53,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {9311#true} assume true; {9311#true} is VALID [2018-11-14 17:32:53,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9311#true} {9311#true} #36#return; {9311#true} is VALID [2018-11-14 17:32:53,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {9311#true} call #t~ret4 := main(); {9311#true} is VALID [2018-11-14 17:32:53,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {9311#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9313#(= main_~i~0 0)} is VALID [2018-11-14 17:32:53,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {9313#(= main_~i~0 0)} assume true; {9313#(= main_~i~0 0)} is VALID [2018-11-14 17:32:53,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {9313#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9313#(= main_~i~0 0)} is VALID [2018-11-14 17:32:53,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {9313#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9314#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:53,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {9314#(<= main_~i~0 1)} assume true; {9314#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:53,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {9314#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9314#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:53,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {9314#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9315#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:53,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {9315#(<= main_~i~0 2)} assume true; {9315#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:53,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {9315#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9315#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:53,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {9315#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9316#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:53,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {9316#(<= main_~i~0 3)} assume true; {9316#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:53,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {9316#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9316#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:53,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {9316#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9317#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:53,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {9317#(<= main_~i~0 4)} assume true; {9317#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:53,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {9317#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9317#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:53,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {9317#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9318#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:53,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {9318#(<= main_~i~0 5)} assume true; {9318#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:53,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {9318#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9318#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:53,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {9318#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9319#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:53,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {9319#(<= main_~i~0 6)} assume true; {9319#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:53,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {9319#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9319#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:53,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {9319#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9320#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:53,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {9320#(<= main_~i~0 7)} assume true; {9320#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:53,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {9320#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9320#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:53,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {9320#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9321#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:53,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {9321#(<= main_~i~0 8)} assume true; {9321#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:53,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {9321#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9321#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:53,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {9321#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9322#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:53,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {9322#(<= main_~i~0 9)} assume true; {9322#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:53,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {9322#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9322#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:53,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {9322#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9323#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:53,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {9323#(<= main_~i~0 10)} assume true; {9323#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:53,609 INFO L273 TraceCheckUtils]: 37: Hoare triple {9323#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9323#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:53,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {9323#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9324#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:53,611 INFO L273 TraceCheckUtils]: 39: Hoare triple {9324#(<= main_~i~0 11)} assume true; {9324#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:53,611 INFO L273 TraceCheckUtils]: 40: Hoare triple {9324#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9324#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:53,612 INFO L273 TraceCheckUtils]: 41: Hoare triple {9324#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9325#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:53,612 INFO L273 TraceCheckUtils]: 42: Hoare triple {9325#(<= main_~i~0 12)} assume true; {9325#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:53,613 INFO L273 TraceCheckUtils]: 43: Hoare triple {9325#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9325#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:53,614 INFO L273 TraceCheckUtils]: 44: Hoare triple {9325#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9326#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:53,614 INFO L273 TraceCheckUtils]: 45: Hoare triple {9326#(<= main_~i~0 13)} assume true; {9326#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:53,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {9326#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9326#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:53,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {9326#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9327#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:53,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {9327#(<= main_~i~0 14)} assume true; {9327#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:53,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {9327#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9327#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:53,617 INFO L273 TraceCheckUtils]: 50: Hoare triple {9327#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9328#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:53,618 INFO L273 TraceCheckUtils]: 51: Hoare triple {9328#(<= main_~i~0 15)} assume true; {9328#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:53,618 INFO L273 TraceCheckUtils]: 52: Hoare triple {9328#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9328#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:53,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {9328#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9329#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:53,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {9329#(<= main_~i~0 16)} assume true; {9329#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:53,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {9329#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9329#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:53,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {9329#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9330#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:53,621 INFO L273 TraceCheckUtils]: 57: Hoare triple {9330#(<= main_~i~0 17)} assume true; {9330#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:53,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {9330#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9330#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:53,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {9330#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9331#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:53,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {9331#(<= main_~i~0 18)} assume true; {9331#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:53,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {9331#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9331#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:53,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {9331#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9332#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:53,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {9332#(<= main_~i~0 19)} assume true; {9332#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:53,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {9332#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9332#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:53,626 INFO L273 TraceCheckUtils]: 65: Hoare triple {9332#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9333#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:53,627 INFO L273 TraceCheckUtils]: 66: Hoare triple {9333#(<= main_~i~0 20)} assume true; {9333#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:53,627 INFO L273 TraceCheckUtils]: 67: Hoare triple {9333#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9333#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:53,628 INFO L273 TraceCheckUtils]: 68: Hoare triple {9333#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9334#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:53,628 INFO L273 TraceCheckUtils]: 69: Hoare triple {9334#(<= main_~i~0 21)} assume true; {9334#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:53,629 INFO L273 TraceCheckUtils]: 70: Hoare triple {9334#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9334#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:53,630 INFO L273 TraceCheckUtils]: 71: Hoare triple {9334#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9335#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:53,630 INFO L273 TraceCheckUtils]: 72: Hoare triple {9335#(<= main_~i~0 22)} assume true; {9335#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:53,631 INFO L273 TraceCheckUtils]: 73: Hoare triple {9335#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9335#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:53,631 INFO L273 TraceCheckUtils]: 74: Hoare triple {9335#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9336#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:53,632 INFO L273 TraceCheckUtils]: 75: Hoare triple {9336#(<= main_~i~0 23)} assume true; {9336#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:53,633 INFO L273 TraceCheckUtils]: 76: Hoare triple {9336#(<= main_~i~0 23)} assume !(~i~0 < 2048); {9312#false} is VALID [2018-11-14 17:32:53,633 INFO L273 TraceCheckUtils]: 77: Hoare triple {9312#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {9312#false} is VALID [2018-11-14 17:32:53,633 INFO L256 TraceCheckUtils]: 78: Hoare triple {9312#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9312#false} is VALID [2018-11-14 17:32:53,633 INFO L273 TraceCheckUtils]: 79: Hoare triple {9312#false} ~cond := #in~cond; {9312#false} is VALID [2018-11-14 17:32:53,634 INFO L273 TraceCheckUtils]: 80: Hoare triple {9312#false} assume ~cond == 0; {9312#false} is VALID [2018-11-14 17:32:53,634 INFO L273 TraceCheckUtils]: 81: Hoare triple {9312#false} assume !false; {9312#false} is VALID [2018-11-14 17:32:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:53,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:53,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:32:54,030 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 17:32:54,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:54,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:54,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {9311#true} call ULTIMATE.init(); {9311#true} is VALID [2018-11-14 17:32:54,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {9311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9311#true} is VALID [2018-11-14 17:32:54,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {9311#true} assume true; {9311#true} is VALID [2018-11-14 17:32:54,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9311#true} {9311#true} #36#return; {9311#true} is VALID [2018-11-14 17:32:54,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {9311#true} call #t~ret4 := main(); {9311#true} is VALID [2018-11-14 17:32:54,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {9311#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9355#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:54,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {9355#(<= main_~i~0 0)} assume true; {9355#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:54,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {9355#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9355#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:54,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {9355#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9314#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:54,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {9314#(<= main_~i~0 1)} assume true; {9314#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:54,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {9314#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9314#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:54,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {9314#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9315#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:54,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {9315#(<= main_~i~0 2)} assume true; {9315#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:54,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {9315#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9315#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:54,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {9315#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9316#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:54,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {9316#(<= main_~i~0 3)} assume true; {9316#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:54,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {9316#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9316#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:54,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {9316#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9317#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:54,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {9317#(<= main_~i~0 4)} assume true; {9317#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:54,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {9317#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9317#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:54,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {9317#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9318#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:54,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {9318#(<= main_~i~0 5)} assume true; {9318#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:54,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {9318#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9318#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:54,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {9318#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9319#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:54,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {9319#(<= main_~i~0 6)} assume true; {9319#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:54,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {9319#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9319#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:54,364 INFO L273 TraceCheckUtils]: 26: Hoare triple {9319#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9320#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:54,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {9320#(<= main_~i~0 7)} assume true; {9320#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:54,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {9320#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9320#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:54,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {9320#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9321#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:54,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {9321#(<= main_~i~0 8)} assume true; {9321#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:54,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {9321#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9321#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:54,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {9321#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9322#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:54,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {9322#(<= main_~i~0 9)} assume true; {9322#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:54,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {9322#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9322#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:54,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {9322#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9323#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:54,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {9323#(<= main_~i~0 10)} assume true; {9323#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:54,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {9323#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9323#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:54,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {9323#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9324#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:54,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {9324#(<= main_~i~0 11)} assume true; {9324#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:54,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {9324#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9324#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:54,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {9324#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9325#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:54,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {9325#(<= main_~i~0 12)} assume true; {9325#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:54,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {9325#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9325#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:54,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {9325#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9326#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:54,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {9326#(<= main_~i~0 13)} assume true; {9326#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:54,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {9326#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9326#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:54,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {9326#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9327#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:54,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {9327#(<= main_~i~0 14)} assume true; {9327#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:54,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {9327#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9327#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:54,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {9327#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9328#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:54,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {9328#(<= main_~i~0 15)} assume true; {9328#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:54,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {9328#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9328#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:54,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {9328#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9329#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:54,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {9329#(<= main_~i~0 16)} assume true; {9329#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:54,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {9329#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9329#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:54,381 INFO L273 TraceCheckUtils]: 56: Hoare triple {9329#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9330#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:54,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {9330#(<= main_~i~0 17)} assume true; {9330#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:54,382 INFO L273 TraceCheckUtils]: 58: Hoare triple {9330#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9330#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:54,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {9330#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9331#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:54,383 INFO L273 TraceCheckUtils]: 60: Hoare triple {9331#(<= main_~i~0 18)} assume true; {9331#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:54,384 INFO L273 TraceCheckUtils]: 61: Hoare triple {9331#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9331#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:54,384 INFO L273 TraceCheckUtils]: 62: Hoare triple {9331#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9332#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:54,385 INFO L273 TraceCheckUtils]: 63: Hoare triple {9332#(<= main_~i~0 19)} assume true; {9332#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:54,385 INFO L273 TraceCheckUtils]: 64: Hoare triple {9332#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9332#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:54,386 INFO L273 TraceCheckUtils]: 65: Hoare triple {9332#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9333#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:54,387 INFO L273 TraceCheckUtils]: 66: Hoare triple {9333#(<= main_~i~0 20)} assume true; {9333#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:54,387 INFO L273 TraceCheckUtils]: 67: Hoare triple {9333#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9333#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:54,388 INFO L273 TraceCheckUtils]: 68: Hoare triple {9333#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9334#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:54,388 INFO L273 TraceCheckUtils]: 69: Hoare triple {9334#(<= main_~i~0 21)} assume true; {9334#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:54,389 INFO L273 TraceCheckUtils]: 70: Hoare triple {9334#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9334#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:54,390 INFO L273 TraceCheckUtils]: 71: Hoare triple {9334#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9335#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:54,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {9335#(<= main_~i~0 22)} assume true; {9335#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:54,391 INFO L273 TraceCheckUtils]: 73: Hoare triple {9335#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9335#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:54,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {9335#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9336#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:54,392 INFO L273 TraceCheckUtils]: 75: Hoare triple {9336#(<= main_~i~0 23)} assume true; {9336#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:54,393 INFO L273 TraceCheckUtils]: 76: Hoare triple {9336#(<= main_~i~0 23)} assume !(~i~0 < 2048); {9312#false} is VALID [2018-11-14 17:32:54,393 INFO L273 TraceCheckUtils]: 77: Hoare triple {9312#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {9312#false} is VALID [2018-11-14 17:32:54,393 INFO L256 TraceCheckUtils]: 78: Hoare triple {9312#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9312#false} is VALID [2018-11-14 17:32:54,393 INFO L273 TraceCheckUtils]: 79: Hoare triple {9312#false} ~cond := #in~cond; {9312#false} is VALID [2018-11-14 17:32:54,393 INFO L273 TraceCheckUtils]: 80: Hoare triple {9312#false} assume ~cond == 0; {9312#false} is VALID [2018-11-14 17:32:54,394 INFO L273 TraceCheckUtils]: 81: Hoare triple {9312#false} assume !false; {9312#false} is VALID [2018-11-14 17:32:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:54,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:54,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 17:32:54,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-14 17:32:54,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:54,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:32:54,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:54,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:32:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:32:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:32:54,500 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 27 states. [2018-11-14 17:32:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,846 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-14 17:32:54,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:32:54,846 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-14 17:32:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:32:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 93 transitions. [2018-11-14 17:32:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:32:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 93 transitions. [2018-11-14 17:32:54,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 93 transitions. [2018-11-14 17:32:54,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:54,944 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:32:54,944 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 17:32:54,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:32:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 17:32:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-14 17:32:54,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:54,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-14 17:32:54,967 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-14 17:32:54,967 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-14 17:32:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,969 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-14 17:32:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-14 17:32:54,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:54,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:54,970 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-14 17:32:54,970 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-14 17:32:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,971 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-14 17:32:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-14 17:32:54,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:54,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:54,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:54,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 17:32:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-11-14 17:32:54,973 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-11-14 17:32:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:54,973 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-11-14 17:32:54,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:32:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-14 17:32:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:32:54,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:54,974 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:54,974 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:54,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 211834403, now seen corresponding path program 24 times [2018-11-14 17:32:54,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:54,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:54,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:54,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:54,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:56,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {10000#true} call ULTIMATE.init(); {10000#true} is VALID [2018-11-14 17:32:56,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {10000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10000#true} is VALID [2018-11-14 17:32:56,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {10000#true} assume true; {10000#true} is VALID [2018-11-14 17:32:56,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10000#true} {10000#true} #36#return; {10000#true} is VALID [2018-11-14 17:32:56,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {10000#true} call #t~ret4 := main(); {10000#true} is VALID [2018-11-14 17:32:56,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {10000#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10002#(= main_~i~0 0)} is VALID [2018-11-14 17:32:56,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {10002#(= main_~i~0 0)} assume true; {10002#(= main_~i~0 0)} is VALID [2018-11-14 17:32:56,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {10002#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10002#(= main_~i~0 0)} is VALID [2018-11-14 17:32:56,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {10002#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10003#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:56,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {10003#(<= main_~i~0 1)} assume true; {10003#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:56,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {10003#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10003#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:56,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {10003#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10004#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:56,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {10004#(<= main_~i~0 2)} assume true; {10004#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:56,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {10004#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10004#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:56,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {10004#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10005#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:56,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {10005#(<= main_~i~0 3)} assume true; {10005#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:56,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {10005#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10005#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:56,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {10005#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10006#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:56,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {10006#(<= main_~i~0 4)} assume true; {10006#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:56,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {10006#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10006#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:56,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {10006#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10007#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:56,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#(<= main_~i~0 5)} assume true; {10007#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:56,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {10007#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10007#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:56,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {10007#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10008#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:56,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {10008#(<= main_~i~0 6)} assume true; {10008#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:56,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {10008#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10008#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:56,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {10008#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10009#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:56,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {10009#(<= main_~i~0 7)} assume true; {10009#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:56,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {10009#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10009#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:56,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {10009#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10010#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:56,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {10010#(<= main_~i~0 8)} assume true; {10010#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:56,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {10010#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10010#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:56,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {10010#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10011#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:56,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {10011#(<= main_~i~0 9)} assume true; {10011#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:56,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {10011#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10011#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:56,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {10011#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10012#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:56,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {10012#(<= main_~i~0 10)} assume true; {10012#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:56,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {10012#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10012#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:56,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {10012#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10013#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:56,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {10013#(<= main_~i~0 11)} assume true; {10013#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:56,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {10013#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10013#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:56,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {10013#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10014#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:56,601 INFO L273 TraceCheckUtils]: 42: Hoare triple {10014#(<= main_~i~0 12)} assume true; {10014#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:56,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {10014#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10014#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:56,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {10014#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10015#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:56,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {10015#(<= main_~i~0 13)} assume true; {10015#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:56,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {10015#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10015#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:56,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {10015#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10016#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:56,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {10016#(<= main_~i~0 14)} assume true; {10016#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:56,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {10016#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10016#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:56,605 INFO L273 TraceCheckUtils]: 50: Hoare triple {10016#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10017#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:56,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {10017#(<= main_~i~0 15)} assume true; {10017#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:56,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {10017#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10017#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:56,607 INFO L273 TraceCheckUtils]: 53: Hoare triple {10017#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10018#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:56,608 INFO L273 TraceCheckUtils]: 54: Hoare triple {10018#(<= main_~i~0 16)} assume true; {10018#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:56,608 INFO L273 TraceCheckUtils]: 55: Hoare triple {10018#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10018#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:56,609 INFO L273 TraceCheckUtils]: 56: Hoare triple {10018#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10019#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:56,609 INFO L273 TraceCheckUtils]: 57: Hoare triple {10019#(<= main_~i~0 17)} assume true; {10019#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:56,610 INFO L273 TraceCheckUtils]: 58: Hoare triple {10019#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10019#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:56,611 INFO L273 TraceCheckUtils]: 59: Hoare triple {10019#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10020#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:56,611 INFO L273 TraceCheckUtils]: 60: Hoare triple {10020#(<= main_~i~0 18)} assume true; {10020#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:56,612 INFO L273 TraceCheckUtils]: 61: Hoare triple {10020#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10020#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:56,612 INFO L273 TraceCheckUtils]: 62: Hoare triple {10020#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10021#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:56,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {10021#(<= main_~i~0 19)} assume true; {10021#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:56,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {10021#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10021#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:56,614 INFO L273 TraceCheckUtils]: 65: Hoare triple {10021#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10022#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:56,615 INFO L273 TraceCheckUtils]: 66: Hoare triple {10022#(<= main_~i~0 20)} assume true; {10022#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:56,615 INFO L273 TraceCheckUtils]: 67: Hoare triple {10022#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10022#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:56,616 INFO L273 TraceCheckUtils]: 68: Hoare triple {10022#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10023#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:56,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {10023#(<= main_~i~0 21)} assume true; {10023#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:56,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {10023#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10023#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:56,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {10023#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10024#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:56,618 INFO L273 TraceCheckUtils]: 72: Hoare triple {10024#(<= main_~i~0 22)} assume true; {10024#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:56,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {10024#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10024#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:56,620 INFO L273 TraceCheckUtils]: 74: Hoare triple {10024#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10025#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:56,620 INFO L273 TraceCheckUtils]: 75: Hoare triple {10025#(<= main_~i~0 23)} assume true; {10025#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:56,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {10025#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10025#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:56,621 INFO L273 TraceCheckUtils]: 77: Hoare triple {10025#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10026#(<= main_~i~0 24)} is VALID [2018-11-14 17:32:56,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {10026#(<= main_~i~0 24)} assume true; {10026#(<= main_~i~0 24)} is VALID [2018-11-14 17:32:56,623 INFO L273 TraceCheckUtils]: 79: Hoare triple {10026#(<= main_~i~0 24)} assume !(~i~0 < 2048); {10001#false} is VALID [2018-11-14 17:32:56,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {10001#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {10001#false} is VALID [2018-11-14 17:32:56,623 INFO L256 TraceCheckUtils]: 81: Hoare triple {10001#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10001#false} is VALID [2018-11-14 17:32:56,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {10001#false} ~cond := #in~cond; {10001#false} is VALID [2018-11-14 17:32:56,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {10001#false} assume ~cond == 0; {10001#false} is VALID [2018-11-14 17:32:56,624 INFO L273 TraceCheckUtils]: 84: Hoare triple {10001#false} assume !false; {10001#false} is VALID [2018-11-14 17:32:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:56,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:56,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:32:59,194 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-14 17:32:59,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:59,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:59,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {10000#true} call ULTIMATE.init(); {10000#true} is VALID [2018-11-14 17:32:59,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {10000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10000#true} is VALID [2018-11-14 17:32:59,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {10000#true} assume true; {10000#true} is VALID [2018-11-14 17:32:59,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10000#true} {10000#true} #36#return; {10000#true} is VALID [2018-11-14 17:32:59,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {10000#true} call #t~ret4 := main(); {10000#true} is VALID [2018-11-14 17:32:59,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {10000#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10045#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:59,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {10045#(<= main_~i~0 0)} assume true; {10045#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:59,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {10045#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10045#(<= main_~i~0 0)} is VALID [2018-11-14 17:32:59,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {10045#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10003#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:59,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {10003#(<= main_~i~0 1)} assume true; {10003#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:59,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {10003#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10003#(<= main_~i~0 1)} is VALID [2018-11-14 17:32:59,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {10003#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10004#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:59,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {10004#(<= main_~i~0 2)} assume true; {10004#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:59,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {10004#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10004#(<= main_~i~0 2)} is VALID [2018-11-14 17:32:59,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {10004#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10005#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:59,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {10005#(<= main_~i~0 3)} assume true; {10005#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:59,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {10005#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10005#(<= main_~i~0 3)} is VALID [2018-11-14 17:32:59,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {10005#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10006#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:59,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {10006#(<= main_~i~0 4)} assume true; {10006#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:59,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {10006#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10006#(<= main_~i~0 4)} is VALID [2018-11-14 17:32:59,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {10006#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10007#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:59,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#(<= main_~i~0 5)} assume true; {10007#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:59,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {10007#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10007#(<= main_~i~0 5)} is VALID [2018-11-14 17:32:59,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {10007#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10008#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:59,438 INFO L273 TraceCheckUtils]: 24: Hoare triple {10008#(<= main_~i~0 6)} assume true; {10008#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:59,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {10008#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10008#(<= main_~i~0 6)} is VALID [2018-11-14 17:32:59,439 INFO L273 TraceCheckUtils]: 26: Hoare triple {10008#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10009#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:59,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {10009#(<= main_~i~0 7)} assume true; {10009#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:59,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {10009#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10009#(<= main_~i~0 7)} is VALID [2018-11-14 17:32:59,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {10009#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10010#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:59,442 INFO L273 TraceCheckUtils]: 30: Hoare triple {10010#(<= main_~i~0 8)} assume true; {10010#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:59,442 INFO L273 TraceCheckUtils]: 31: Hoare triple {10010#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10010#(<= main_~i~0 8)} is VALID [2018-11-14 17:32:59,443 INFO L273 TraceCheckUtils]: 32: Hoare triple {10010#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10011#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:59,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {10011#(<= main_~i~0 9)} assume true; {10011#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:59,444 INFO L273 TraceCheckUtils]: 34: Hoare triple {10011#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10011#(<= main_~i~0 9)} is VALID [2018-11-14 17:32:59,445 INFO L273 TraceCheckUtils]: 35: Hoare triple {10011#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10012#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:59,445 INFO L273 TraceCheckUtils]: 36: Hoare triple {10012#(<= main_~i~0 10)} assume true; {10012#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:59,446 INFO L273 TraceCheckUtils]: 37: Hoare triple {10012#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10012#(<= main_~i~0 10)} is VALID [2018-11-14 17:32:59,446 INFO L273 TraceCheckUtils]: 38: Hoare triple {10012#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10013#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:59,447 INFO L273 TraceCheckUtils]: 39: Hoare triple {10013#(<= main_~i~0 11)} assume true; {10013#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:59,447 INFO L273 TraceCheckUtils]: 40: Hoare triple {10013#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10013#(<= main_~i~0 11)} is VALID [2018-11-14 17:32:59,448 INFO L273 TraceCheckUtils]: 41: Hoare triple {10013#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10014#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:59,449 INFO L273 TraceCheckUtils]: 42: Hoare triple {10014#(<= main_~i~0 12)} assume true; {10014#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:59,449 INFO L273 TraceCheckUtils]: 43: Hoare triple {10014#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10014#(<= main_~i~0 12)} is VALID [2018-11-14 17:32:59,455 INFO L273 TraceCheckUtils]: 44: Hoare triple {10014#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10015#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:59,455 INFO L273 TraceCheckUtils]: 45: Hoare triple {10015#(<= main_~i~0 13)} assume true; {10015#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:59,456 INFO L273 TraceCheckUtils]: 46: Hoare triple {10015#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10015#(<= main_~i~0 13)} is VALID [2018-11-14 17:32:59,456 INFO L273 TraceCheckUtils]: 47: Hoare triple {10015#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10016#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:59,456 INFO L273 TraceCheckUtils]: 48: Hoare triple {10016#(<= main_~i~0 14)} assume true; {10016#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:59,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {10016#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10016#(<= main_~i~0 14)} is VALID [2018-11-14 17:32:59,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {10016#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10017#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:59,457 INFO L273 TraceCheckUtils]: 51: Hoare triple {10017#(<= main_~i~0 15)} assume true; {10017#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:59,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {10017#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10017#(<= main_~i~0 15)} is VALID [2018-11-14 17:32:59,458 INFO L273 TraceCheckUtils]: 53: Hoare triple {10017#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10018#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:59,459 INFO L273 TraceCheckUtils]: 54: Hoare triple {10018#(<= main_~i~0 16)} assume true; {10018#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:59,459 INFO L273 TraceCheckUtils]: 55: Hoare triple {10018#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10018#(<= main_~i~0 16)} is VALID [2018-11-14 17:32:59,460 INFO L273 TraceCheckUtils]: 56: Hoare triple {10018#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10019#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:59,461 INFO L273 TraceCheckUtils]: 57: Hoare triple {10019#(<= main_~i~0 17)} assume true; {10019#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:59,461 INFO L273 TraceCheckUtils]: 58: Hoare triple {10019#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10019#(<= main_~i~0 17)} is VALID [2018-11-14 17:32:59,462 INFO L273 TraceCheckUtils]: 59: Hoare triple {10019#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10020#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:59,462 INFO L273 TraceCheckUtils]: 60: Hoare triple {10020#(<= main_~i~0 18)} assume true; {10020#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:59,463 INFO L273 TraceCheckUtils]: 61: Hoare triple {10020#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10020#(<= main_~i~0 18)} is VALID [2018-11-14 17:32:59,464 INFO L273 TraceCheckUtils]: 62: Hoare triple {10020#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10021#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:59,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {10021#(<= main_~i~0 19)} assume true; {10021#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:59,465 INFO L273 TraceCheckUtils]: 64: Hoare triple {10021#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10021#(<= main_~i~0 19)} is VALID [2018-11-14 17:32:59,465 INFO L273 TraceCheckUtils]: 65: Hoare triple {10021#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10022#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:59,466 INFO L273 TraceCheckUtils]: 66: Hoare triple {10022#(<= main_~i~0 20)} assume true; {10022#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:59,466 INFO L273 TraceCheckUtils]: 67: Hoare triple {10022#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10022#(<= main_~i~0 20)} is VALID [2018-11-14 17:32:59,467 INFO L273 TraceCheckUtils]: 68: Hoare triple {10022#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10023#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:59,468 INFO L273 TraceCheckUtils]: 69: Hoare triple {10023#(<= main_~i~0 21)} assume true; {10023#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:59,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {10023#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10023#(<= main_~i~0 21)} is VALID [2018-11-14 17:32:59,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {10023#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10024#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:59,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {10024#(<= main_~i~0 22)} assume true; {10024#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:59,470 INFO L273 TraceCheckUtils]: 73: Hoare triple {10024#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10024#(<= main_~i~0 22)} is VALID [2018-11-14 17:32:59,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {10024#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10025#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:59,471 INFO L273 TraceCheckUtils]: 75: Hoare triple {10025#(<= main_~i~0 23)} assume true; {10025#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:59,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {10025#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10025#(<= main_~i~0 23)} is VALID [2018-11-14 17:32:59,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {10025#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10026#(<= main_~i~0 24)} is VALID [2018-11-14 17:32:59,473 INFO L273 TraceCheckUtils]: 78: Hoare triple {10026#(<= main_~i~0 24)} assume true; {10026#(<= main_~i~0 24)} is VALID [2018-11-14 17:32:59,473 INFO L273 TraceCheckUtils]: 79: Hoare triple {10026#(<= main_~i~0 24)} assume !(~i~0 < 2048); {10001#false} is VALID [2018-11-14 17:32:59,473 INFO L273 TraceCheckUtils]: 80: Hoare triple {10001#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {10001#false} is VALID [2018-11-14 17:32:59,474 INFO L256 TraceCheckUtils]: 81: Hoare triple {10001#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10001#false} is VALID [2018-11-14 17:32:59,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {10001#false} ~cond := #in~cond; {10001#false} is VALID [2018-11-14 17:32:59,474 INFO L273 TraceCheckUtils]: 83: Hoare triple {10001#false} assume ~cond == 0; {10001#false} is VALID [2018-11-14 17:32:59,474 INFO L273 TraceCheckUtils]: 84: Hoare triple {10001#false} assume !false; {10001#false} is VALID [2018-11-14 17:32:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:59,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:59,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-14 17:32:59,502 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-14 17:32:59,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:59,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 17:32:59,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:59,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 17:32:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 17:32:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:32:59,608 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 28 states. [2018-11-14 17:32:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:59,974 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-14 17:32:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:32:59,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-14 17:32:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:32:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2018-11-14 17:32:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:32:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2018-11-14 17:32:59,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 96 transitions. [2018-11-14 17:33:00,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:00,113 INFO L225 Difference]: With dead ends: 96 [2018-11-14 17:33:00,113 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 17:33:00,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:33:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 17:33:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-14 17:33:00,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:00,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-14 17:33:00,136 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-14 17:33:00,136 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-14 17:33:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:00,137 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-14 17:33:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-14 17:33:00,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:00,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:00,138 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-14 17:33:00,138 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-14 17:33:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:00,139 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-14 17:33:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-14 17:33:00,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:00,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:00,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:00,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:33:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-14 17:33:00,141 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-11-14 17:33:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:00,141 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-14 17:33:00,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 17:33:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-14 17:33:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-14 17:33:00,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:00,142 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:00,143 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:00,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1749472998, now seen corresponding path program 25 times [2018-11-14 17:33:00,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:00,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:01,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {10713#true} call ULTIMATE.init(); {10713#true} is VALID [2018-11-14 17:33:01,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {10713#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10713#true} is VALID [2018-11-14 17:33:01,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {10713#true} assume true; {10713#true} is VALID [2018-11-14 17:33:01,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10713#true} {10713#true} #36#return; {10713#true} is VALID [2018-11-14 17:33:01,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {10713#true} call #t~ret4 := main(); {10713#true} is VALID [2018-11-14 17:33:01,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {10713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10715#(= main_~i~0 0)} is VALID [2018-11-14 17:33:01,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {10715#(= main_~i~0 0)} assume true; {10715#(= main_~i~0 0)} is VALID [2018-11-14 17:33:01,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {10715#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10715#(= main_~i~0 0)} is VALID [2018-11-14 17:33:01,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {10715#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10716#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:01,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {10716#(<= main_~i~0 1)} assume true; {10716#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:01,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {10716#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10716#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:01,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {10716#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10717#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:01,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {10717#(<= main_~i~0 2)} assume true; {10717#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:01,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {10717#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10717#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:01,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {10717#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10718#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:01,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {10718#(<= main_~i~0 3)} assume true; {10718#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:01,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {10718#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10718#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:01,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {10718#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10719#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:01,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {10719#(<= main_~i~0 4)} assume true; {10719#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:01,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {10719#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10719#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:01,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {10719#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10720#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:01,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {10720#(<= main_~i~0 5)} assume true; {10720#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:01,466 INFO L273 TraceCheckUtils]: 22: Hoare triple {10720#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10720#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:01,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {10720#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10721#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:01,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {10721#(<= main_~i~0 6)} assume true; {10721#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:01,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {10721#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10721#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:01,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {10721#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10722#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:01,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {10722#(<= main_~i~0 7)} assume true; {10722#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:01,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {10722#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10722#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:01,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {10722#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10723#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:01,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {10723#(<= main_~i~0 8)} assume true; {10723#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:01,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {10723#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10723#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:01,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {10723#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10724#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:01,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {10724#(<= main_~i~0 9)} assume true; {10724#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:01,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {10724#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10724#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:01,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {10724#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10725#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:01,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {10725#(<= main_~i~0 10)} assume true; {10725#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:01,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {10725#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10725#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:01,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {10725#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10726#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:01,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {10726#(<= main_~i~0 11)} assume true; {10726#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:01,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {10726#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10726#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:01,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {10726#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10727#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:01,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {10727#(<= main_~i~0 12)} assume true; {10727#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:01,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {10727#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10727#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:01,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {10727#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10728#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:01,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {10728#(<= main_~i~0 13)} assume true; {10728#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:01,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {10728#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10728#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:01,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {10728#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10729#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:01,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {10729#(<= main_~i~0 14)} assume true; {10729#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:01,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {10729#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10729#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:01,482 INFO L273 TraceCheckUtils]: 50: Hoare triple {10729#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10730#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:01,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {10730#(<= main_~i~0 15)} assume true; {10730#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:01,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {10730#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10730#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:01,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {10730#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10731#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:01,485 INFO L273 TraceCheckUtils]: 54: Hoare triple {10731#(<= main_~i~0 16)} assume true; {10731#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:01,485 INFO L273 TraceCheckUtils]: 55: Hoare triple {10731#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10731#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:01,486 INFO L273 TraceCheckUtils]: 56: Hoare triple {10731#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10732#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:01,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {10732#(<= main_~i~0 17)} assume true; {10732#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:01,487 INFO L273 TraceCheckUtils]: 58: Hoare triple {10732#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10732#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:01,488 INFO L273 TraceCheckUtils]: 59: Hoare triple {10732#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10733#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:01,488 INFO L273 TraceCheckUtils]: 60: Hoare triple {10733#(<= main_~i~0 18)} assume true; {10733#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:01,489 INFO L273 TraceCheckUtils]: 61: Hoare triple {10733#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10733#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:01,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {10733#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10734#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:01,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {10734#(<= main_~i~0 19)} assume true; {10734#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:01,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {10734#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10734#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:01,491 INFO L273 TraceCheckUtils]: 65: Hoare triple {10734#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10735#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:01,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {10735#(<= main_~i~0 20)} assume true; {10735#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:01,492 INFO L273 TraceCheckUtils]: 67: Hoare triple {10735#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10735#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:01,493 INFO L273 TraceCheckUtils]: 68: Hoare triple {10735#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10736#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:01,493 INFO L273 TraceCheckUtils]: 69: Hoare triple {10736#(<= main_~i~0 21)} assume true; {10736#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:01,494 INFO L273 TraceCheckUtils]: 70: Hoare triple {10736#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10736#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:01,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {10736#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10737#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:01,495 INFO L273 TraceCheckUtils]: 72: Hoare triple {10737#(<= main_~i~0 22)} assume true; {10737#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:01,495 INFO L273 TraceCheckUtils]: 73: Hoare triple {10737#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10737#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:01,496 INFO L273 TraceCheckUtils]: 74: Hoare triple {10737#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10738#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:01,496 INFO L273 TraceCheckUtils]: 75: Hoare triple {10738#(<= main_~i~0 23)} assume true; {10738#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:01,497 INFO L273 TraceCheckUtils]: 76: Hoare triple {10738#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10738#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:01,498 INFO L273 TraceCheckUtils]: 77: Hoare triple {10738#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10739#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:01,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {10739#(<= main_~i~0 24)} assume true; {10739#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:01,499 INFO L273 TraceCheckUtils]: 79: Hoare triple {10739#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10739#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:01,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {10739#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10740#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:01,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {10740#(<= main_~i~0 25)} assume true; {10740#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:01,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {10740#(<= main_~i~0 25)} assume !(~i~0 < 2048); {10714#false} is VALID [2018-11-14 17:33:01,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {10714#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {10714#false} is VALID [2018-11-14 17:33:01,501 INFO L256 TraceCheckUtils]: 84: Hoare triple {10714#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10714#false} is VALID [2018-11-14 17:33:01,501 INFO L273 TraceCheckUtils]: 85: Hoare triple {10714#false} ~cond := #in~cond; {10714#false} is VALID [2018-11-14 17:33:01,501 INFO L273 TraceCheckUtils]: 86: Hoare triple {10714#false} assume ~cond == 0; {10714#false} is VALID [2018-11-14 17:33:01,501 INFO L273 TraceCheckUtils]: 87: Hoare triple {10714#false} assume !false; {10714#false} is VALID [2018-11-14 17:33:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:01,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:01,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:01,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:01,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:01,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {10713#true} call ULTIMATE.init(); {10713#true} is VALID [2018-11-14 17:33:01,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {10713#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10713#true} is VALID [2018-11-14 17:33:01,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {10713#true} assume true; {10713#true} is VALID [2018-11-14 17:33:01,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10713#true} {10713#true} #36#return; {10713#true} is VALID [2018-11-14 17:33:01,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {10713#true} call #t~ret4 := main(); {10713#true} is VALID [2018-11-14 17:33:01,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {10713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10759#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:01,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {10759#(<= main_~i~0 0)} assume true; {10759#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:01,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {10759#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10759#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:01,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {10759#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10716#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:01,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {10716#(<= main_~i~0 1)} assume true; {10716#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:01,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {10716#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10716#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:01,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {10716#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10717#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:01,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {10717#(<= main_~i~0 2)} assume true; {10717#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:01,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {10717#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10717#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:01,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {10717#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10718#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:01,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {10718#(<= main_~i~0 3)} assume true; {10718#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:01,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {10718#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10718#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:01,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {10718#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10719#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:01,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {10719#(<= main_~i~0 4)} assume true; {10719#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:01,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {10719#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10719#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:01,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {10719#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10720#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:01,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {10720#(<= main_~i~0 5)} assume true; {10720#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:01,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {10720#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10720#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:01,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {10720#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10721#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:01,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {10721#(<= main_~i~0 6)} assume true; {10721#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:01,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {10721#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10721#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:01,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {10721#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10722#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:01,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {10722#(<= main_~i~0 7)} assume true; {10722#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:01,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {10722#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10722#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:01,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {10722#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10723#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:01,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {10723#(<= main_~i~0 8)} assume true; {10723#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:01,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {10723#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10723#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:01,815 INFO L273 TraceCheckUtils]: 32: Hoare triple {10723#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10724#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:01,816 INFO L273 TraceCheckUtils]: 33: Hoare triple {10724#(<= main_~i~0 9)} assume true; {10724#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:01,816 INFO L273 TraceCheckUtils]: 34: Hoare triple {10724#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10724#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:01,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {10724#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10725#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:01,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {10725#(<= main_~i~0 10)} assume true; {10725#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:01,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {10725#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10725#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:01,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {10725#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10726#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:01,819 INFO L273 TraceCheckUtils]: 39: Hoare triple {10726#(<= main_~i~0 11)} assume true; {10726#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:01,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {10726#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10726#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:01,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {10726#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10727#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:01,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {10727#(<= main_~i~0 12)} assume true; {10727#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:01,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {10727#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10727#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:01,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {10727#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10728#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:01,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {10728#(<= main_~i~0 13)} assume true; {10728#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:01,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {10728#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10728#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:01,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {10728#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10729#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:01,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {10729#(<= main_~i~0 14)} assume true; {10729#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:01,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {10729#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10729#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:01,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {10729#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10730#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:01,827 INFO L273 TraceCheckUtils]: 51: Hoare triple {10730#(<= main_~i~0 15)} assume true; {10730#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:01,828 INFO L273 TraceCheckUtils]: 52: Hoare triple {10730#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10730#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:01,829 INFO L273 TraceCheckUtils]: 53: Hoare triple {10730#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10731#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:01,829 INFO L273 TraceCheckUtils]: 54: Hoare triple {10731#(<= main_~i~0 16)} assume true; {10731#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:01,830 INFO L273 TraceCheckUtils]: 55: Hoare triple {10731#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10731#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:01,830 INFO L273 TraceCheckUtils]: 56: Hoare triple {10731#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10732#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:01,831 INFO L273 TraceCheckUtils]: 57: Hoare triple {10732#(<= main_~i~0 17)} assume true; {10732#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:01,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {10732#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10732#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:01,832 INFO L273 TraceCheckUtils]: 59: Hoare triple {10732#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10733#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:01,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {10733#(<= main_~i~0 18)} assume true; {10733#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:01,834 INFO L273 TraceCheckUtils]: 61: Hoare triple {10733#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10733#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:01,834 INFO L273 TraceCheckUtils]: 62: Hoare triple {10733#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10734#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:01,835 INFO L273 TraceCheckUtils]: 63: Hoare triple {10734#(<= main_~i~0 19)} assume true; {10734#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:01,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {10734#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10734#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:01,837 INFO L273 TraceCheckUtils]: 65: Hoare triple {10734#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10735#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:01,837 INFO L273 TraceCheckUtils]: 66: Hoare triple {10735#(<= main_~i~0 20)} assume true; {10735#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:01,838 INFO L273 TraceCheckUtils]: 67: Hoare triple {10735#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10735#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:01,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {10735#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10736#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:01,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {10736#(<= main_~i~0 21)} assume true; {10736#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:01,840 INFO L273 TraceCheckUtils]: 70: Hoare triple {10736#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10736#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:01,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {10736#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10737#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:01,841 INFO L273 TraceCheckUtils]: 72: Hoare triple {10737#(<= main_~i~0 22)} assume true; {10737#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:01,841 INFO L273 TraceCheckUtils]: 73: Hoare triple {10737#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10737#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:01,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {10737#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10738#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:01,843 INFO L273 TraceCheckUtils]: 75: Hoare triple {10738#(<= main_~i~0 23)} assume true; {10738#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:01,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {10738#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10738#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:01,844 INFO L273 TraceCheckUtils]: 77: Hoare triple {10738#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10739#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:01,844 INFO L273 TraceCheckUtils]: 78: Hoare triple {10739#(<= main_~i~0 24)} assume true; {10739#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:01,845 INFO L273 TraceCheckUtils]: 79: Hoare triple {10739#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10739#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:01,845 INFO L273 TraceCheckUtils]: 80: Hoare triple {10739#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10740#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:01,846 INFO L273 TraceCheckUtils]: 81: Hoare triple {10740#(<= main_~i~0 25)} assume true; {10740#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:01,847 INFO L273 TraceCheckUtils]: 82: Hoare triple {10740#(<= main_~i~0 25)} assume !(~i~0 < 2048); {10714#false} is VALID [2018-11-14 17:33:01,847 INFO L273 TraceCheckUtils]: 83: Hoare triple {10714#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {10714#false} is VALID [2018-11-14 17:33:01,847 INFO L256 TraceCheckUtils]: 84: Hoare triple {10714#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10714#false} is VALID [2018-11-14 17:33:01,847 INFO L273 TraceCheckUtils]: 85: Hoare triple {10714#false} ~cond := #in~cond; {10714#false} is VALID [2018-11-14 17:33:01,847 INFO L273 TraceCheckUtils]: 86: Hoare triple {10714#false} assume ~cond == 0; {10714#false} is VALID [2018-11-14 17:33:01,848 INFO L273 TraceCheckUtils]: 87: Hoare triple {10714#false} assume !false; {10714#false} is VALID [2018-11-14 17:33:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:01,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 17:33:01,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-14 17:33:01,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:01,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 17:33:01,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:01,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 17:33:01,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 17:33:01,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:33:01,972 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 29 states. [2018-11-14 17:33:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,424 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-14 17:33:02,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:33:02,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-14 17:33:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:33:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 99 transitions. [2018-11-14 17:33:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:33:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 99 transitions. [2018-11-14 17:33:02,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 99 transitions. [2018-11-14 17:33:02,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:02,520 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:33:02,520 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:33:02,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:33:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:33:02,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 17:33:02,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:02,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 17:33:02,548 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 17:33:02,548 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 17:33:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,551 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-14 17:33:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-14 17:33:02,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:02,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:02,552 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 17:33:02,552 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 17:33:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,553 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-14 17:33:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-14 17:33:02,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:02,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:02,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:02,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:33:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-11-14 17:33:02,556 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-11-14 17:33:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:02,556 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-11-14 17:33:02,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 17:33:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-14 17:33:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 17:33:02,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:02,557 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:02,557 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:02,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1971805891, now seen corresponding path program 26 times [2018-11-14 17:33:02,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:02,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:02,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:03,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {11450#true} call ULTIMATE.init(); {11450#true} is VALID [2018-11-14 17:33:03,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {11450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11450#true} is VALID [2018-11-14 17:33:03,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {11450#true} assume true; {11450#true} is VALID [2018-11-14 17:33:03,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11450#true} {11450#true} #36#return; {11450#true} is VALID [2018-11-14 17:33:03,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {11450#true} call #t~ret4 := main(); {11450#true} is VALID [2018-11-14 17:33:03,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {11450#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11452#(= main_~i~0 0)} is VALID [2018-11-14 17:33:03,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {11452#(= main_~i~0 0)} assume true; {11452#(= main_~i~0 0)} is VALID [2018-11-14 17:33:03,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {11452#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11452#(= main_~i~0 0)} is VALID [2018-11-14 17:33:03,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {11452#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11453#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:03,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {11453#(<= main_~i~0 1)} assume true; {11453#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:03,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {11453#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11453#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:03,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {11453#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11454#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:03,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {11454#(<= main_~i~0 2)} assume true; {11454#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:03,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {11454#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11454#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:03,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {11454#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11455#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:03,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {11455#(<= main_~i~0 3)} assume true; {11455#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:03,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {11455#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11455#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:03,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {11455#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11456#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:03,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {11456#(<= main_~i~0 4)} assume true; {11456#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:03,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {11456#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11456#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:03,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {11456#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11457#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:03,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {11457#(<= main_~i~0 5)} assume true; {11457#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:03,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {11457#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11457#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:03,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {11457#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11458#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:03,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {11458#(<= main_~i~0 6)} assume true; {11458#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:03,703 INFO L273 TraceCheckUtils]: 25: Hoare triple {11458#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11458#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:03,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {11458#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11459#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:03,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {11459#(<= main_~i~0 7)} assume true; {11459#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:03,705 INFO L273 TraceCheckUtils]: 28: Hoare triple {11459#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11459#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:03,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {11459#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11460#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:03,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {11460#(<= main_~i~0 8)} assume true; {11460#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:03,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {11460#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11460#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:03,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {11460#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11461#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:03,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {11461#(<= main_~i~0 9)} assume true; {11461#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:03,708 INFO L273 TraceCheckUtils]: 34: Hoare triple {11461#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11461#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:03,709 INFO L273 TraceCheckUtils]: 35: Hoare triple {11461#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11462#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:03,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {11462#(<= main_~i~0 10)} assume true; {11462#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:03,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {11462#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11462#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:03,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {11462#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11463#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:03,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {11463#(<= main_~i~0 11)} assume true; {11463#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:03,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {11463#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11463#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:03,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {11463#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11464#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:03,738 INFO L273 TraceCheckUtils]: 42: Hoare triple {11464#(<= main_~i~0 12)} assume true; {11464#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:03,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {11464#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11464#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:03,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {11464#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11465#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:03,739 INFO L273 TraceCheckUtils]: 45: Hoare triple {11465#(<= main_~i~0 13)} assume true; {11465#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:03,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {11465#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11465#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:03,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {11465#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11466#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:03,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {11466#(<= main_~i~0 14)} assume true; {11466#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:03,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {11466#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11466#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:03,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {11466#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11467#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:03,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {11467#(<= main_~i~0 15)} assume true; {11467#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:03,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {11467#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11467#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:03,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {11467#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11468#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:03,743 INFO L273 TraceCheckUtils]: 54: Hoare triple {11468#(<= main_~i~0 16)} assume true; {11468#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:03,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {11468#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11468#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:03,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {11468#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11469#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:03,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {11469#(<= main_~i~0 17)} assume true; {11469#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:03,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {11469#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11469#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:03,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {11469#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11470#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:03,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {11470#(<= main_~i~0 18)} assume true; {11470#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:03,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {11470#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11470#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:03,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {11470#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11471#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:03,751 INFO L273 TraceCheckUtils]: 63: Hoare triple {11471#(<= main_~i~0 19)} assume true; {11471#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:03,751 INFO L273 TraceCheckUtils]: 64: Hoare triple {11471#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11471#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:03,752 INFO L273 TraceCheckUtils]: 65: Hoare triple {11471#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11472#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:03,752 INFO L273 TraceCheckUtils]: 66: Hoare triple {11472#(<= main_~i~0 20)} assume true; {11472#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:03,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {11472#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11472#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:03,753 INFO L273 TraceCheckUtils]: 68: Hoare triple {11472#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11473#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:03,753 INFO L273 TraceCheckUtils]: 69: Hoare triple {11473#(<= main_~i~0 21)} assume true; {11473#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:03,754 INFO L273 TraceCheckUtils]: 70: Hoare triple {11473#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11473#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:03,754 INFO L273 TraceCheckUtils]: 71: Hoare triple {11473#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11474#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:03,755 INFO L273 TraceCheckUtils]: 72: Hoare triple {11474#(<= main_~i~0 22)} assume true; {11474#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:03,755 INFO L273 TraceCheckUtils]: 73: Hoare triple {11474#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11474#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:03,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {11474#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11475#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:03,757 INFO L273 TraceCheckUtils]: 75: Hoare triple {11475#(<= main_~i~0 23)} assume true; {11475#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:03,757 INFO L273 TraceCheckUtils]: 76: Hoare triple {11475#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11475#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:03,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {11475#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11476#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:03,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {11476#(<= main_~i~0 24)} assume true; {11476#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:03,759 INFO L273 TraceCheckUtils]: 79: Hoare triple {11476#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11476#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:03,760 INFO L273 TraceCheckUtils]: 80: Hoare triple {11476#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11477#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:03,760 INFO L273 TraceCheckUtils]: 81: Hoare triple {11477#(<= main_~i~0 25)} assume true; {11477#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:03,761 INFO L273 TraceCheckUtils]: 82: Hoare triple {11477#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11477#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:03,761 INFO L273 TraceCheckUtils]: 83: Hoare triple {11477#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11478#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:03,762 INFO L273 TraceCheckUtils]: 84: Hoare triple {11478#(<= main_~i~0 26)} assume true; {11478#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:03,762 INFO L273 TraceCheckUtils]: 85: Hoare triple {11478#(<= main_~i~0 26)} assume !(~i~0 < 2048); {11451#false} is VALID [2018-11-14 17:33:03,763 INFO L273 TraceCheckUtils]: 86: Hoare triple {11451#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {11451#false} is VALID [2018-11-14 17:33:03,763 INFO L256 TraceCheckUtils]: 87: Hoare triple {11451#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11451#false} is VALID [2018-11-14 17:33:03,763 INFO L273 TraceCheckUtils]: 88: Hoare triple {11451#false} ~cond := #in~cond; {11451#false} is VALID [2018-11-14 17:33:03,763 INFO L273 TraceCheckUtils]: 89: Hoare triple {11451#false} assume ~cond == 0; {11451#false} is VALID [2018-11-14 17:33:03,764 INFO L273 TraceCheckUtils]: 90: Hoare triple {11451#false} assume !false; {11451#false} is VALID [2018-11-14 17:33:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:03,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:03,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:03,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:33:03,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:33:03,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:03,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:04,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {11450#true} call ULTIMATE.init(); {11450#true} is VALID [2018-11-14 17:33:04,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {11450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11450#true} is VALID [2018-11-14 17:33:04,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {11450#true} assume true; {11450#true} is VALID [2018-11-14 17:33:04,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11450#true} {11450#true} #36#return; {11450#true} is VALID [2018-11-14 17:33:04,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {11450#true} call #t~ret4 := main(); {11450#true} is VALID [2018-11-14 17:33:04,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {11450#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11497#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:04,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {11497#(<= main_~i~0 0)} assume true; {11497#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:04,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {11497#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11497#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:04,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {11497#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11453#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:04,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {11453#(<= main_~i~0 1)} assume true; {11453#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:04,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {11453#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11453#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:04,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {11453#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11454#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:04,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {11454#(<= main_~i~0 2)} assume true; {11454#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:04,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {11454#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11454#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:04,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {11454#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11455#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:04,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {11455#(<= main_~i~0 3)} assume true; {11455#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:04,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {11455#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11455#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:04,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {11455#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11456#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:04,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {11456#(<= main_~i~0 4)} assume true; {11456#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:04,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {11456#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11456#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:04,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {11456#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11457#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:04,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {11457#(<= main_~i~0 5)} assume true; {11457#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:04,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {11457#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11457#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:04,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {11457#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11458#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:04,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {11458#(<= main_~i~0 6)} assume true; {11458#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:04,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {11458#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11458#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:04,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {11458#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11459#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:04,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {11459#(<= main_~i~0 7)} assume true; {11459#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:04,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {11459#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11459#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:04,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {11459#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11460#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:04,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {11460#(<= main_~i~0 8)} assume true; {11460#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:04,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {11460#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11460#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:04,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {11460#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11461#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:04,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {11461#(<= main_~i~0 9)} assume true; {11461#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:04,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {11461#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11461#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:04,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {11461#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11462#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:04,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {11462#(<= main_~i~0 10)} assume true; {11462#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:04,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {11462#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11462#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:04,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {11462#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11463#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:04,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {11463#(<= main_~i~0 11)} assume true; {11463#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:04,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {11463#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11463#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:04,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {11463#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11464#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:04,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {11464#(<= main_~i~0 12)} assume true; {11464#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:04,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {11464#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11464#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:04,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {11464#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11465#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:04,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {11465#(<= main_~i~0 13)} assume true; {11465#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:04,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {11465#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11465#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:04,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {11465#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11466#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:04,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {11466#(<= main_~i~0 14)} assume true; {11466#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:04,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {11466#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11466#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:04,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {11466#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11467#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:04,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {11467#(<= main_~i~0 15)} assume true; {11467#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:04,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {11467#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11467#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:04,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {11467#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11468#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:04,049 INFO L273 TraceCheckUtils]: 54: Hoare triple {11468#(<= main_~i~0 16)} assume true; {11468#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:04,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {11468#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11468#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:04,050 INFO L273 TraceCheckUtils]: 56: Hoare triple {11468#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11469#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:04,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {11469#(<= main_~i~0 17)} assume true; {11469#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:04,051 INFO L273 TraceCheckUtils]: 58: Hoare triple {11469#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11469#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:04,052 INFO L273 TraceCheckUtils]: 59: Hoare triple {11469#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11470#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:04,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {11470#(<= main_~i~0 18)} assume true; {11470#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:04,053 INFO L273 TraceCheckUtils]: 61: Hoare triple {11470#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11470#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:04,053 INFO L273 TraceCheckUtils]: 62: Hoare triple {11470#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11471#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:04,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {11471#(<= main_~i~0 19)} assume true; {11471#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:04,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {11471#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11471#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:04,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {11471#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11472#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:04,056 INFO L273 TraceCheckUtils]: 66: Hoare triple {11472#(<= main_~i~0 20)} assume true; {11472#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:04,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {11472#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11472#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:04,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {11472#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11473#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:04,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {11473#(<= main_~i~0 21)} assume true; {11473#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:04,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {11473#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11473#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:04,059 INFO L273 TraceCheckUtils]: 71: Hoare triple {11473#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11474#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:04,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {11474#(<= main_~i~0 22)} assume true; {11474#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:04,062 INFO L273 TraceCheckUtils]: 73: Hoare triple {11474#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11474#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:04,062 INFO L273 TraceCheckUtils]: 74: Hoare triple {11474#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11475#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:04,063 INFO L273 TraceCheckUtils]: 75: Hoare triple {11475#(<= main_~i~0 23)} assume true; {11475#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:04,063 INFO L273 TraceCheckUtils]: 76: Hoare triple {11475#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11475#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:04,063 INFO L273 TraceCheckUtils]: 77: Hoare triple {11475#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11476#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:04,064 INFO L273 TraceCheckUtils]: 78: Hoare triple {11476#(<= main_~i~0 24)} assume true; {11476#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:04,064 INFO L273 TraceCheckUtils]: 79: Hoare triple {11476#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11476#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:04,064 INFO L273 TraceCheckUtils]: 80: Hoare triple {11476#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11477#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:04,065 INFO L273 TraceCheckUtils]: 81: Hoare triple {11477#(<= main_~i~0 25)} assume true; {11477#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:04,066 INFO L273 TraceCheckUtils]: 82: Hoare triple {11477#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11477#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:04,066 INFO L273 TraceCheckUtils]: 83: Hoare triple {11477#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11478#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:04,067 INFO L273 TraceCheckUtils]: 84: Hoare triple {11478#(<= main_~i~0 26)} assume true; {11478#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:04,067 INFO L273 TraceCheckUtils]: 85: Hoare triple {11478#(<= main_~i~0 26)} assume !(~i~0 < 2048); {11451#false} is VALID [2018-11-14 17:33:04,068 INFO L273 TraceCheckUtils]: 86: Hoare triple {11451#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {11451#false} is VALID [2018-11-14 17:33:04,068 INFO L256 TraceCheckUtils]: 87: Hoare triple {11451#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11451#false} is VALID [2018-11-14 17:33:04,068 INFO L273 TraceCheckUtils]: 88: Hoare triple {11451#false} ~cond := #in~cond; {11451#false} is VALID [2018-11-14 17:33:04,068 INFO L273 TraceCheckUtils]: 89: Hoare triple {11451#false} assume ~cond == 0; {11451#false} is VALID [2018-11-14 17:33:04,068 INFO L273 TraceCheckUtils]: 90: Hoare triple {11451#false} assume !false; {11451#false} is VALID [2018-11-14 17:33:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:04,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:04,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 17:33:04,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-14 17:33:04,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:04,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:33:04,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:04,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:33:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:33:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:33:04,186 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 30 states. [2018-11-14 17:33:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:04,541 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-14 17:33:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:33:04,541 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-14 17:33:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:33:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 102 transitions. [2018-11-14 17:33:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:33:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 102 transitions. [2018-11-14 17:33:04,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 102 transitions. [2018-11-14 17:33:04,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:04,686 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:33:04,686 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:33:04,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:33:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:33:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 17:33:04,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:04,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 17:33:04,720 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 17:33:04,720 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 17:33:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:04,722 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-14 17:33:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-14 17:33:04,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:04,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:04,723 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 17:33:04,723 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 17:33:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:04,725 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-14 17:33:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-14 17:33:04,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:04,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:04,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:04,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 17:33:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-14 17:33:04,728 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-11-14 17:33:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:04,728 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-14 17:33:04,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:33:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-14 17:33:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 17:33:04,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:04,729 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:04,729 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:04,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash 895343738, now seen corresponding path program 27 times [2018-11-14 17:33:04,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:04,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:04,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:05,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {12211#true} call ULTIMATE.init(); {12211#true} is VALID [2018-11-14 17:33:05,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {12211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12211#true} is VALID [2018-11-14 17:33:05,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {12211#true} assume true; {12211#true} is VALID [2018-11-14 17:33:05,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12211#true} {12211#true} #36#return; {12211#true} is VALID [2018-11-14 17:33:05,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {12211#true} call #t~ret4 := main(); {12211#true} is VALID [2018-11-14 17:33:05,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {12211#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12213#(= main_~i~0 0)} is VALID [2018-11-14 17:33:05,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {12213#(= main_~i~0 0)} assume true; {12213#(= main_~i~0 0)} is VALID [2018-11-14 17:33:05,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {12213#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12213#(= main_~i~0 0)} is VALID [2018-11-14 17:33:05,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {12213#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12214#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:05,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {12214#(<= main_~i~0 1)} assume true; {12214#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:05,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {12214#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12214#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:05,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {12214#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12215#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:05,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {12215#(<= main_~i~0 2)} assume true; {12215#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:05,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {12215#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12215#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:05,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {12215#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12216#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:05,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {12216#(<= main_~i~0 3)} assume true; {12216#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:05,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {12216#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12216#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:05,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {12216#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12217#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:05,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {12217#(<= main_~i~0 4)} assume true; {12217#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:05,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {12217#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12217#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:05,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {12217#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12218#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:05,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {12218#(<= main_~i~0 5)} assume true; {12218#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:05,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {12218#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12218#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:05,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {12218#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12219#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:05,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {12219#(<= main_~i~0 6)} assume true; {12219#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:05,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {12219#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12219#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:05,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {12219#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12220#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:05,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {12220#(<= main_~i~0 7)} assume true; {12220#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:05,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {12220#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12220#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:05,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {12220#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12221#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:05,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {12221#(<= main_~i~0 8)} assume true; {12221#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:05,419 INFO L273 TraceCheckUtils]: 31: Hoare triple {12221#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12221#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:05,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {12221#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12222#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:05,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {12222#(<= main_~i~0 9)} assume true; {12222#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:05,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {12222#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12222#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:05,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {12222#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12223#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:05,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {12223#(<= main_~i~0 10)} assume true; {12223#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:05,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {12223#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12223#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:05,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {12223#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12224#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:05,423 INFO L273 TraceCheckUtils]: 39: Hoare triple {12224#(<= main_~i~0 11)} assume true; {12224#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:05,424 INFO L273 TraceCheckUtils]: 40: Hoare triple {12224#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12224#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:05,425 INFO L273 TraceCheckUtils]: 41: Hoare triple {12224#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12225#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:05,425 INFO L273 TraceCheckUtils]: 42: Hoare triple {12225#(<= main_~i~0 12)} assume true; {12225#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:05,426 INFO L273 TraceCheckUtils]: 43: Hoare triple {12225#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12225#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:05,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {12225#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12226#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:05,427 INFO L273 TraceCheckUtils]: 45: Hoare triple {12226#(<= main_~i~0 13)} assume true; {12226#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:05,427 INFO L273 TraceCheckUtils]: 46: Hoare triple {12226#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12226#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:05,428 INFO L273 TraceCheckUtils]: 47: Hoare triple {12226#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12227#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:05,429 INFO L273 TraceCheckUtils]: 48: Hoare triple {12227#(<= main_~i~0 14)} assume true; {12227#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:05,429 INFO L273 TraceCheckUtils]: 49: Hoare triple {12227#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12227#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:05,430 INFO L273 TraceCheckUtils]: 50: Hoare triple {12227#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12228#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:05,430 INFO L273 TraceCheckUtils]: 51: Hoare triple {12228#(<= main_~i~0 15)} assume true; {12228#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:05,431 INFO L273 TraceCheckUtils]: 52: Hoare triple {12228#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12228#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:05,432 INFO L273 TraceCheckUtils]: 53: Hoare triple {12228#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12229#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:05,432 INFO L273 TraceCheckUtils]: 54: Hoare triple {12229#(<= main_~i~0 16)} assume true; {12229#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:05,433 INFO L273 TraceCheckUtils]: 55: Hoare triple {12229#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12229#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:05,433 INFO L273 TraceCheckUtils]: 56: Hoare triple {12229#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12230#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:05,434 INFO L273 TraceCheckUtils]: 57: Hoare triple {12230#(<= main_~i~0 17)} assume true; {12230#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:05,434 INFO L273 TraceCheckUtils]: 58: Hoare triple {12230#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12230#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:05,435 INFO L273 TraceCheckUtils]: 59: Hoare triple {12230#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12231#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:05,436 INFO L273 TraceCheckUtils]: 60: Hoare triple {12231#(<= main_~i~0 18)} assume true; {12231#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:05,436 INFO L273 TraceCheckUtils]: 61: Hoare triple {12231#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12231#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:05,437 INFO L273 TraceCheckUtils]: 62: Hoare triple {12231#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12232#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:05,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {12232#(<= main_~i~0 19)} assume true; {12232#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:05,438 INFO L273 TraceCheckUtils]: 64: Hoare triple {12232#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12232#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:05,439 INFO L273 TraceCheckUtils]: 65: Hoare triple {12232#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12233#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:05,439 INFO L273 TraceCheckUtils]: 66: Hoare triple {12233#(<= main_~i~0 20)} assume true; {12233#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:05,440 INFO L273 TraceCheckUtils]: 67: Hoare triple {12233#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12233#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:05,440 INFO L273 TraceCheckUtils]: 68: Hoare triple {12233#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12234#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:05,441 INFO L273 TraceCheckUtils]: 69: Hoare triple {12234#(<= main_~i~0 21)} assume true; {12234#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:05,441 INFO L273 TraceCheckUtils]: 70: Hoare triple {12234#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12234#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:05,442 INFO L273 TraceCheckUtils]: 71: Hoare triple {12234#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12235#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:05,443 INFO L273 TraceCheckUtils]: 72: Hoare triple {12235#(<= main_~i~0 22)} assume true; {12235#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:05,443 INFO L273 TraceCheckUtils]: 73: Hoare triple {12235#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12235#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:05,444 INFO L273 TraceCheckUtils]: 74: Hoare triple {12235#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12236#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:05,444 INFO L273 TraceCheckUtils]: 75: Hoare triple {12236#(<= main_~i~0 23)} assume true; {12236#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:05,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {12236#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12236#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:05,446 INFO L273 TraceCheckUtils]: 77: Hoare triple {12236#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12237#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:05,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {12237#(<= main_~i~0 24)} assume true; {12237#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:05,447 INFO L273 TraceCheckUtils]: 79: Hoare triple {12237#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12237#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:05,447 INFO L273 TraceCheckUtils]: 80: Hoare triple {12237#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12238#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:05,448 INFO L273 TraceCheckUtils]: 81: Hoare triple {12238#(<= main_~i~0 25)} assume true; {12238#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:05,448 INFO L273 TraceCheckUtils]: 82: Hoare triple {12238#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12238#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:05,449 INFO L273 TraceCheckUtils]: 83: Hoare triple {12238#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12239#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:05,450 INFO L273 TraceCheckUtils]: 84: Hoare triple {12239#(<= main_~i~0 26)} assume true; {12239#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:05,450 INFO L273 TraceCheckUtils]: 85: Hoare triple {12239#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12239#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:05,451 INFO L273 TraceCheckUtils]: 86: Hoare triple {12239#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12240#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:05,451 INFO L273 TraceCheckUtils]: 87: Hoare triple {12240#(<= main_~i~0 27)} assume true; {12240#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:05,452 INFO L273 TraceCheckUtils]: 88: Hoare triple {12240#(<= main_~i~0 27)} assume !(~i~0 < 2048); {12212#false} is VALID [2018-11-14 17:33:05,452 INFO L273 TraceCheckUtils]: 89: Hoare triple {12212#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {12212#false} is VALID [2018-11-14 17:33:05,452 INFO L256 TraceCheckUtils]: 90: Hoare triple {12212#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12212#false} is VALID [2018-11-14 17:33:05,453 INFO L273 TraceCheckUtils]: 91: Hoare triple {12212#false} ~cond := #in~cond; {12212#false} is VALID [2018-11-14 17:33:05,453 INFO L273 TraceCheckUtils]: 92: Hoare triple {12212#false} assume ~cond == 0; {12212#false} is VALID [2018-11-14 17:33:05,453 INFO L273 TraceCheckUtils]: 93: Hoare triple {12212#false} assume !false; {12212#false} is VALID [2018-11-14 17:33:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:05,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:33:08,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-14 17:33:08,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:08,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:08,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {12211#true} call ULTIMATE.init(); {12211#true} is VALID [2018-11-14 17:33:08,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {12211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12211#true} is VALID [2018-11-14 17:33:08,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {12211#true} assume true; {12211#true} is VALID [2018-11-14 17:33:08,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12211#true} {12211#true} #36#return; {12211#true} is VALID [2018-11-14 17:33:08,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {12211#true} call #t~ret4 := main(); {12211#true} is VALID [2018-11-14 17:33:08,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {12211#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12259#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:08,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {12259#(<= main_~i~0 0)} assume true; {12259#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:08,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {12259#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12259#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:08,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {12259#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12214#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:08,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {12214#(<= main_~i~0 1)} assume true; {12214#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:08,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {12214#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12214#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:08,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {12214#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12215#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:08,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {12215#(<= main_~i~0 2)} assume true; {12215#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:08,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {12215#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12215#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:08,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {12215#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12216#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:08,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {12216#(<= main_~i~0 3)} assume true; {12216#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:08,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {12216#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12216#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:08,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {12216#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12217#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:08,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {12217#(<= main_~i~0 4)} assume true; {12217#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:08,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {12217#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12217#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:08,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {12217#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12218#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:08,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {12218#(<= main_~i~0 5)} assume true; {12218#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:08,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {12218#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12218#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:08,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {12218#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12219#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:08,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {12219#(<= main_~i~0 6)} assume true; {12219#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:08,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {12219#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12219#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:08,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {12219#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12220#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:08,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {12220#(<= main_~i~0 7)} assume true; {12220#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:08,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {12220#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12220#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:08,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {12220#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12221#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:08,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {12221#(<= main_~i~0 8)} assume true; {12221#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:08,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {12221#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12221#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:08,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {12221#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12222#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:08,841 INFO L273 TraceCheckUtils]: 33: Hoare triple {12222#(<= main_~i~0 9)} assume true; {12222#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:08,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {12222#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12222#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:08,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {12222#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12223#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:08,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {12223#(<= main_~i~0 10)} assume true; {12223#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:08,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {12223#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12223#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:08,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {12223#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12224#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:08,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {12224#(<= main_~i~0 11)} assume true; {12224#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:08,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {12224#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12224#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:08,846 INFO L273 TraceCheckUtils]: 41: Hoare triple {12224#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12225#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:08,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {12225#(<= main_~i~0 12)} assume true; {12225#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:08,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {12225#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12225#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:08,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {12225#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12226#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:08,848 INFO L273 TraceCheckUtils]: 45: Hoare triple {12226#(<= main_~i~0 13)} assume true; {12226#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:08,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {12226#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12226#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:08,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {12226#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12227#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:08,850 INFO L273 TraceCheckUtils]: 48: Hoare triple {12227#(<= main_~i~0 14)} assume true; {12227#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:08,850 INFO L273 TraceCheckUtils]: 49: Hoare triple {12227#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12227#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:08,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {12227#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12228#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:08,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {12228#(<= main_~i~0 15)} assume true; {12228#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:08,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {12228#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12228#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:08,853 INFO L273 TraceCheckUtils]: 53: Hoare triple {12228#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12229#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:08,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {12229#(<= main_~i~0 16)} assume true; {12229#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:08,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {12229#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12229#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:08,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {12229#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12230#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:08,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {12230#(<= main_~i~0 17)} assume true; {12230#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:08,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {12230#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12230#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:08,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {12230#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12231#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:08,857 INFO L273 TraceCheckUtils]: 60: Hoare triple {12231#(<= main_~i~0 18)} assume true; {12231#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:08,857 INFO L273 TraceCheckUtils]: 61: Hoare triple {12231#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12231#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:08,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {12231#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12232#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:08,858 INFO L273 TraceCheckUtils]: 63: Hoare triple {12232#(<= main_~i~0 19)} assume true; {12232#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:08,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {12232#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12232#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:08,860 INFO L273 TraceCheckUtils]: 65: Hoare triple {12232#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12233#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:08,860 INFO L273 TraceCheckUtils]: 66: Hoare triple {12233#(<= main_~i~0 20)} assume true; {12233#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:08,861 INFO L273 TraceCheckUtils]: 67: Hoare triple {12233#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12233#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:08,861 INFO L273 TraceCheckUtils]: 68: Hoare triple {12233#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12234#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:08,862 INFO L273 TraceCheckUtils]: 69: Hoare triple {12234#(<= main_~i~0 21)} assume true; {12234#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:08,862 INFO L273 TraceCheckUtils]: 70: Hoare triple {12234#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12234#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:08,863 INFO L273 TraceCheckUtils]: 71: Hoare triple {12234#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12235#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:08,864 INFO L273 TraceCheckUtils]: 72: Hoare triple {12235#(<= main_~i~0 22)} assume true; {12235#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:08,864 INFO L273 TraceCheckUtils]: 73: Hoare triple {12235#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12235#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:08,865 INFO L273 TraceCheckUtils]: 74: Hoare triple {12235#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12236#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:08,865 INFO L273 TraceCheckUtils]: 75: Hoare triple {12236#(<= main_~i~0 23)} assume true; {12236#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:08,866 INFO L273 TraceCheckUtils]: 76: Hoare triple {12236#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12236#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:08,867 INFO L273 TraceCheckUtils]: 77: Hoare triple {12236#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12237#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:08,867 INFO L273 TraceCheckUtils]: 78: Hoare triple {12237#(<= main_~i~0 24)} assume true; {12237#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:08,868 INFO L273 TraceCheckUtils]: 79: Hoare triple {12237#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12237#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:08,868 INFO L273 TraceCheckUtils]: 80: Hoare triple {12237#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12238#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:08,869 INFO L273 TraceCheckUtils]: 81: Hoare triple {12238#(<= main_~i~0 25)} assume true; {12238#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:08,869 INFO L273 TraceCheckUtils]: 82: Hoare triple {12238#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12238#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:08,870 INFO L273 TraceCheckUtils]: 83: Hoare triple {12238#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12239#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:08,871 INFO L273 TraceCheckUtils]: 84: Hoare triple {12239#(<= main_~i~0 26)} assume true; {12239#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:08,871 INFO L273 TraceCheckUtils]: 85: Hoare triple {12239#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12239#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:08,872 INFO L273 TraceCheckUtils]: 86: Hoare triple {12239#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12240#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:08,872 INFO L273 TraceCheckUtils]: 87: Hoare triple {12240#(<= main_~i~0 27)} assume true; {12240#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:08,873 INFO L273 TraceCheckUtils]: 88: Hoare triple {12240#(<= main_~i~0 27)} assume !(~i~0 < 2048); {12212#false} is VALID [2018-11-14 17:33:08,873 INFO L273 TraceCheckUtils]: 89: Hoare triple {12212#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {12212#false} is VALID [2018-11-14 17:33:08,874 INFO L256 TraceCheckUtils]: 90: Hoare triple {12212#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12212#false} is VALID [2018-11-14 17:33:08,874 INFO L273 TraceCheckUtils]: 91: Hoare triple {12212#false} ~cond := #in~cond; {12212#false} is VALID [2018-11-14 17:33:08,874 INFO L273 TraceCheckUtils]: 92: Hoare triple {12212#false} assume ~cond == 0; {12212#false} is VALID [2018-11-14 17:33:08,874 INFO L273 TraceCheckUtils]: 93: Hoare triple {12212#false} assume !false; {12212#false} is VALID [2018-11-14 17:33:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:08,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:08,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 17:33:08,902 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-14 17:33:08,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:08,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:33:08,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:08,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:33:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:33:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:33:08,996 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 31 states. [2018-11-14 17:33:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:09,373 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-14 17:33:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:33:09,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-14 17:33:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:33:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2018-11-14 17:33:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:33:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2018-11-14 17:33:09,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 105 transitions. [2018-11-14 17:33:09,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:09,474 INFO L225 Difference]: With dead ends: 105 [2018-11-14 17:33:09,474 INFO L226 Difference]: Without dead ends: 99 [2018-11-14 17:33:09,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:33:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-14 17:33:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-14 17:33:09,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:09,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 98 states. [2018-11-14 17:33:09,512 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 98 states. [2018-11-14 17:33:09,512 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 98 states. [2018-11-14 17:33:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:09,513 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-14 17:33:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-14 17:33:09,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:09,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:09,514 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 99 states. [2018-11-14 17:33:09,514 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 99 states. [2018-11-14 17:33:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:09,515 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-14 17:33:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-14 17:33:09,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:09,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:09,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:09,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 17:33:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-11-14 17:33:09,518 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-11-14 17:33:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:09,518 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-11-14 17:33:09,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:33:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-11-14 17:33:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 17:33:09,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:09,519 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:09,520 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:09,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1762824349, now seen corresponding path program 28 times [2018-11-14 17:33:09,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:09,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:09,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:10,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2018-11-14 17:33:10,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {12996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12996#true} is VALID [2018-11-14 17:33:10,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2018-11-14 17:33:10,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #36#return; {12996#true} is VALID [2018-11-14 17:33:10,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret4 := main(); {12996#true} is VALID [2018-11-14 17:33:10,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {12996#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12998#(= main_~i~0 0)} is VALID [2018-11-14 17:33:10,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {12998#(= main_~i~0 0)} assume true; {12998#(= main_~i~0 0)} is VALID [2018-11-14 17:33:10,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {12998#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12998#(= main_~i~0 0)} is VALID [2018-11-14 17:33:10,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {12998#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12999#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:10,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {12999#(<= main_~i~0 1)} assume true; {12999#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:10,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {12999#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12999#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:10,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {12999#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13000#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:10,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {13000#(<= main_~i~0 2)} assume true; {13000#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:10,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {13000#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13000#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:10,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {13000#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13001#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:10,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {13001#(<= main_~i~0 3)} assume true; {13001#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:10,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {13001#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13001#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:10,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {13001#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13002#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:10,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {13002#(<= main_~i~0 4)} assume true; {13002#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:10,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {13002#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13002#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:10,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {13002#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13003#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:10,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {13003#(<= main_~i~0 5)} assume true; {13003#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:10,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {13003#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13003#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:10,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {13003#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13004#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:10,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {13004#(<= main_~i~0 6)} assume true; {13004#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:10,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {13004#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13004#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:10,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {13004#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13005#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:10,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {13005#(<= main_~i~0 7)} assume true; {13005#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:10,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {13005#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13005#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:10,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {13005#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13006#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:10,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {13006#(<= main_~i~0 8)} assume true; {13006#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:10,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {13006#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13006#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:10,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {13006#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13007#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:10,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {13007#(<= main_~i~0 9)} assume true; {13007#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:10,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {13007#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13007#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:10,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {13007#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13008#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:10,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {13008#(<= main_~i~0 10)} assume true; {13008#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:10,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {13008#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13008#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:10,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {13008#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13009#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:10,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {13009#(<= main_~i~0 11)} assume true; {13009#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:10,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {13009#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13009#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:10,104 INFO L273 TraceCheckUtils]: 41: Hoare triple {13009#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13010#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:10,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {13010#(<= main_~i~0 12)} assume true; {13010#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:10,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {13010#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13010#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:10,106 INFO L273 TraceCheckUtils]: 44: Hoare triple {13010#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13011#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:10,107 INFO L273 TraceCheckUtils]: 45: Hoare triple {13011#(<= main_~i~0 13)} assume true; {13011#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:10,107 INFO L273 TraceCheckUtils]: 46: Hoare triple {13011#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13011#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:10,108 INFO L273 TraceCheckUtils]: 47: Hoare triple {13011#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13012#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:10,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {13012#(<= main_~i~0 14)} assume true; {13012#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:10,109 INFO L273 TraceCheckUtils]: 49: Hoare triple {13012#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13012#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:10,110 INFO L273 TraceCheckUtils]: 50: Hoare triple {13012#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13013#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:10,110 INFO L273 TraceCheckUtils]: 51: Hoare triple {13013#(<= main_~i~0 15)} assume true; {13013#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:10,111 INFO L273 TraceCheckUtils]: 52: Hoare triple {13013#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13013#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:10,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {13013#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13014#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:10,112 INFO L273 TraceCheckUtils]: 54: Hoare triple {13014#(<= main_~i~0 16)} assume true; {13014#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:10,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {13014#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13014#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:10,113 INFO L273 TraceCheckUtils]: 56: Hoare triple {13014#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13015#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:10,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {13015#(<= main_~i~0 17)} assume true; {13015#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:10,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {13015#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13015#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:10,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {13015#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13016#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:10,115 INFO L273 TraceCheckUtils]: 60: Hoare triple {13016#(<= main_~i~0 18)} assume true; {13016#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:10,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {13016#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13016#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:10,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {13016#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13017#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:10,117 INFO L273 TraceCheckUtils]: 63: Hoare triple {13017#(<= main_~i~0 19)} assume true; {13017#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:10,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {13017#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13017#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:10,118 INFO L273 TraceCheckUtils]: 65: Hoare triple {13017#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13018#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:10,119 INFO L273 TraceCheckUtils]: 66: Hoare triple {13018#(<= main_~i~0 20)} assume true; {13018#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:10,119 INFO L273 TraceCheckUtils]: 67: Hoare triple {13018#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13018#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:10,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {13018#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13019#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:10,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {13019#(<= main_~i~0 21)} assume true; {13019#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:10,121 INFO L273 TraceCheckUtils]: 70: Hoare triple {13019#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13019#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:10,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {13019#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13020#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:10,122 INFO L273 TraceCheckUtils]: 72: Hoare triple {13020#(<= main_~i~0 22)} assume true; {13020#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:10,123 INFO L273 TraceCheckUtils]: 73: Hoare triple {13020#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13020#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:10,124 INFO L273 TraceCheckUtils]: 74: Hoare triple {13020#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13021#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:10,124 INFO L273 TraceCheckUtils]: 75: Hoare triple {13021#(<= main_~i~0 23)} assume true; {13021#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:10,125 INFO L273 TraceCheckUtils]: 76: Hoare triple {13021#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13021#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:10,125 INFO L273 TraceCheckUtils]: 77: Hoare triple {13021#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13022#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:10,126 INFO L273 TraceCheckUtils]: 78: Hoare triple {13022#(<= main_~i~0 24)} assume true; {13022#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:10,126 INFO L273 TraceCheckUtils]: 79: Hoare triple {13022#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13022#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:10,127 INFO L273 TraceCheckUtils]: 80: Hoare triple {13022#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13023#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:10,128 INFO L273 TraceCheckUtils]: 81: Hoare triple {13023#(<= main_~i~0 25)} assume true; {13023#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:10,128 INFO L273 TraceCheckUtils]: 82: Hoare triple {13023#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13023#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:10,129 INFO L273 TraceCheckUtils]: 83: Hoare triple {13023#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13024#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:10,129 INFO L273 TraceCheckUtils]: 84: Hoare triple {13024#(<= main_~i~0 26)} assume true; {13024#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:10,130 INFO L273 TraceCheckUtils]: 85: Hoare triple {13024#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13024#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:10,131 INFO L273 TraceCheckUtils]: 86: Hoare triple {13024#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13025#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:10,131 INFO L273 TraceCheckUtils]: 87: Hoare triple {13025#(<= main_~i~0 27)} assume true; {13025#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:10,132 INFO L273 TraceCheckUtils]: 88: Hoare triple {13025#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13025#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:10,132 INFO L273 TraceCheckUtils]: 89: Hoare triple {13025#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13026#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:10,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {13026#(<= main_~i~0 28)} assume true; {13026#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:10,157 INFO L273 TraceCheckUtils]: 91: Hoare triple {13026#(<= main_~i~0 28)} assume !(~i~0 < 2048); {12997#false} is VALID [2018-11-14 17:33:10,157 INFO L273 TraceCheckUtils]: 92: Hoare triple {12997#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {12997#false} is VALID [2018-11-14 17:33:10,157 INFO L256 TraceCheckUtils]: 93: Hoare triple {12997#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12997#false} is VALID [2018-11-14 17:33:10,157 INFO L273 TraceCheckUtils]: 94: Hoare triple {12997#false} ~cond := #in~cond; {12997#false} is VALID [2018-11-14 17:33:10,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {12997#false} assume ~cond == 0; {12997#false} is VALID [2018-11-14 17:33:10,158 INFO L273 TraceCheckUtils]: 96: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2018-11-14 17:33:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:10,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:10,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:10,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:33:10,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:33:10,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:10,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:10,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2018-11-14 17:33:10,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {12996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12996#true} is VALID [2018-11-14 17:33:10,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2018-11-14 17:33:10,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #36#return; {12996#true} is VALID [2018-11-14 17:33:10,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret4 := main(); {12996#true} is VALID [2018-11-14 17:33:10,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {12996#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13045#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:10,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {13045#(<= main_~i~0 0)} assume true; {13045#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:10,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {13045#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13045#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:10,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {13045#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12999#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:10,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {12999#(<= main_~i~0 1)} assume true; {12999#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:10,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {12999#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12999#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:10,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {12999#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13000#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:10,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {13000#(<= main_~i~0 2)} assume true; {13000#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:10,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {13000#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13000#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:10,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {13000#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13001#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:10,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {13001#(<= main_~i~0 3)} assume true; {13001#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:10,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {13001#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13001#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:10,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {13001#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13002#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:10,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {13002#(<= main_~i~0 4)} assume true; {13002#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:10,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {13002#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13002#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:10,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {13002#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13003#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:10,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {13003#(<= main_~i~0 5)} assume true; {13003#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:10,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {13003#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13003#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:10,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {13003#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13004#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:10,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {13004#(<= main_~i~0 6)} assume true; {13004#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:10,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {13004#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13004#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:10,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {13004#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13005#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:10,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {13005#(<= main_~i~0 7)} assume true; {13005#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:10,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {13005#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13005#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:10,526 INFO L273 TraceCheckUtils]: 29: Hoare triple {13005#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13006#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:10,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {13006#(<= main_~i~0 8)} assume true; {13006#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:10,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {13006#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13006#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:10,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {13006#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13007#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:10,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {13007#(<= main_~i~0 9)} assume true; {13007#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:10,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {13007#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13007#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:10,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {13007#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13008#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:10,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {13008#(<= main_~i~0 10)} assume true; {13008#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:10,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {13008#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13008#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:10,535 INFO L273 TraceCheckUtils]: 38: Hoare triple {13008#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13009#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:10,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {13009#(<= main_~i~0 11)} assume true; {13009#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:10,536 INFO L273 TraceCheckUtils]: 40: Hoare triple {13009#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13009#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:10,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {13009#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13010#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:10,537 INFO L273 TraceCheckUtils]: 42: Hoare triple {13010#(<= main_~i~0 12)} assume true; {13010#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:10,537 INFO L273 TraceCheckUtils]: 43: Hoare triple {13010#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13010#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:10,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {13010#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13011#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:10,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {13011#(<= main_~i~0 13)} assume true; {13011#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:10,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {13011#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13011#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:10,540 INFO L273 TraceCheckUtils]: 47: Hoare triple {13011#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13012#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:10,540 INFO L273 TraceCheckUtils]: 48: Hoare triple {13012#(<= main_~i~0 14)} assume true; {13012#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:10,541 INFO L273 TraceCheckUtils]: 49: Hoare triple {13012#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13012#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:10,550 INFO L273 TraceCheckUtils]: 50: Hoare triple {13012#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13013#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:10,550 INFO L273 TraceCheckUtils]: 51: Hoare triple {13013#(<= main_~i~0 15)} assume true; {13013#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:10,551 INFO L273 TraceCheckUtils]: 52: Hoare triple {13013#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13013#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:10,551 INFO L273 TraceCheckUtils]: 53: Hoare triple {13013#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13014#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:10,552 INFO L273 TraceCheckUtils]: 54: Hoare triple {13014#(<= main_~i~0 16)} assume true; {13014#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:10,552 INFO L273 TraceCheckUtils]: 55: Hoare triple {13014#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13014#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:10,552 INFO L273 TraceCheckUtils]: 56: Hoare triple {13014#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13015#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:10,553 INFO L273 TraceCheckUtils]: 57: Hoare triple {13015#(<= main_~i~0 17)} assume true; {13015#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:10,553 INFO L273 TraceCheckUtils]: 58: Hoare triple {13015#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13015#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:10,553 INFO L273 TraceCheckUtils]: 59: Hoare triple {13015#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13016#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:10,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {13016#(<= main_~i~0 18)} assume true; {13016#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:10,554 INFO L273 TraceCheckUtils]: 61: Hoare triple {13016#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13016#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:10,555 INFO L273 TraceCheckUtils]: 62: Hoare triple {13016#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13017#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:10,556 INFO L273 TraceCheckUtils]: 63: Hoare triple {13017#(<= main_~i~0 19)} assume true; {13017#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:10,556 INFO L273 TraceCheckUtils]: 64: Hoare triple {13017#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13017#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:10,557 INFO L273 TraceCheckUtils]: 65: Hoare triple {13017#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13018#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:10,557 INFO L273 TraceCheckUtils]: 66: Hoare triple {13018#(<= main_~i~0 20)} assume true; {13018#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:10,558 INFO L273 TraceCheckUtils]: 67: Hoare triple {13018#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13018#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:10,559 INFO L273 TraceCheckUtils]: 68: Hoare triple {13018#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13019#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:10,559 INFO L273 TraceCheckUtils]: 69: Hoare triple {13019#(<= main_~i~0 21)} assume true; {13019#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:10,560 INFO L273 TraceCheckUtils]: 70: Hoare triple {13019#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13019#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:10,560 INFO L273 TraceCheckUtils]: 71: Hoare triple {13019#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13020#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:10,561 INFO L273 TraceCheckUtils]: 72: Hoare triple {13020#(<= main_~i~0 22)} assume true; {13020#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:10,561 INFO L273 TraceCheckUtils]: 73: Hoare triple {13020#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13020#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:10,562 INFO L273 TraceCheckUtils]: 74: Hoare triple {13020#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13021#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:10,563 INFO L273 TraceCheckUtils]: 75: Hoare triple {13021#(<= main_~i~0 23)} assume true; {13021#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:10,563 INFO L273 TraceCheckUtils]: 76: Hoare triple {13021#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13021#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:10,564 INFO L273 TraceCheckUtils]: 77: Hoare triple {13021#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13022#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:10,564 INFO L273 TraceCheckUtils]: 78: Hoare triple {13022#(<= main_~i~0 24)} assume true; {13022#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:10,565 INFO L273 TraceCheckUtils]: 79: Hoare triple {13022#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13022#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:10,566 INFO L273 TraceCheckUtils]: 80: Hoare triple {13022#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13023#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:10,566 INFO L273 TraceCheckUtils]: 81: Hoare triple {13023#(<= main_~i~0 25)} assume true; {13023#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:10,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {13023#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13023#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:10,567 INFO L273 TraceCheckUtils]: 83: Hoare triple {13023#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13024#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:10,568 INFO L273 TraceCheckUtils]: 84: Hoare triple {13024#(<= main_~i~0 26)} assume true; {13024#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:10,568 INFO L273 TraceCheckUtils]: 85: Hoare triple {13024#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13024#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:10,569 INFO L273 TraceCheckUtils]: 86: Hoare triple {13024#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13025#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:10,569 INFO L273 TraceCheckUtils]: 87: Hoare triple {13025#(<= main_~i~0 27)} assume true; {13025#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:10,575 INFO L273 TraceCheckUtils]: 88: Hoare triple {13025#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13025#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:10,576 INFO L273 TraceCheckUtils]: 89: Hoare triple {13025#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13026#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:10,576 INFO L273 TraceCheckUtils]: 90: Hoare triple {13026#(<= main_~i~0 28)} assume true; {13026#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:10,576 INFO L273 TraceCheckUtils]: 91: Hoare triple {13026#(<= main_~i~0 28)} assume !(~i~0 < 2048); {12997#false} is VALID [2018-11-14 17:33:10,576 INFO L273 TraceCheckUtils]: 92: Hoare triple {12997#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {12997#false} is VALID [2018-11-14 17:33:10,577 INFO L256 TraceCheckUtils]: 93: Hoare triple {12997#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12997#false} is VALID [2018-11-14 17:33:10,577 INFO L273 TraceCheckUtils]: 94: Hoare triple {12997#false} ~cond := #in~cond; {12997#false} is VALID [2018-11-14 17:33:10,577 INFO L273 TraceCheckUtils]: 95: Hoare triple {12997#false} assume ~cond == 0; {12997#false} is VALID [2018-11-14 17:33:10,577 INFO L273 TraceCheckUtils]: 96: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2018-11-14 17:33:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:10,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:10,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 17:33:10,603 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-14 17:33:10,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:10,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:33:10,761 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-14 17:33:10,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:33:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:33:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:33:10,763 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 32 states. [2018-11-14 17:33:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:11,351 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-14 17:33:11,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:33:11,351 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-14 17:33:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:33:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 108 transitions. [2018-11-14 17:33:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:33:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 108 transitions. [2018-11-14 17:33:11,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 108 transitions. [2018-11-14 17:33:11,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:11,455 INFO L225 Difference]: With dead ends: 108 [2018-11-14 17:33:11,455 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 17:33:11,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:33:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 17:33:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-14 17:33:11,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:11,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 101 states. [2018-11-14 17:33:11,490 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 101 states. [2018-11-14 17:33:11,490 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 101 states. [2018-11-14 17:33:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:11,492 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-14 17:33:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-14 17:33:11,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:11,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:11,493 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 102 states. [2018-11-14 17:33:11,493 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 102 states. [2018-11-14 17:33:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:11,494 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-14 17:33:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-14 17:33:11,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:11,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:11,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:11,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:33:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-14 17:33:11,497 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-11-14 17:33:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:11,497 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-14 17:33:11,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:33:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-14 17:33:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-14 17:33:11,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:11,498 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:11,498 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:11,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:11,499 INFO L82 PathProgramCache]: Analyzing trace with hash -641300518, now seen corresponding path program 29 times [2018-11-14 17:33:11,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:11,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:11,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:12,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {13805#true} call ULTIMATE.init(); {13805#true} is VALID [2018-11-14 17:33:12,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {13805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13805#true} is VALID [2018-11-14 17:33:12,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {13805#true} assume true; {13805#true} is VALID [2018-11-14 17:33:12,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13805#true} {13805#true} #36#return; {13805#true} is VALID [2018-11-14 17:33:12,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {13805#true} call #t~ret4 := main(); {13805#true} is VALID [2018-11-14 17:33:12,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {13805#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13807#(= main_~i~0 0)} is VALID [2018-11-14 17:33:12,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {13807#(= main_~i~0 0)} assume true; {13807#(= main_~i~0 0)} is VALID [2018-11-14 17:33:12,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {13807#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13807#(= main_~i~0 0)} is VALID [2018-11-14 17:33:12,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {13807#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13808#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:12,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {13808#(<= main_~i~0 1)} assume true; {13808#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:12,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {13808#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13808#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:12,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {13808#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13809#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:12,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {13809#(<= main_~i~0 2)} assume true; {13809#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:12,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {13809#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13809#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:12,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {13809#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13810#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:12,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {13810#(<= main_~i~0 3)} assume true; {13810#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:12,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {13810#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13810#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:12,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {13810#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13811#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:12,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {13811#(<= main_~i~0 4)} assume true; {13811#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:12,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {13811#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13811#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:12,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {13811#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13812#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:12,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {13812#(<= main_~i~0 5)} assume true; {13812#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:12,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {13812#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13812#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:12,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {13812#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13813#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:12,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {13813#(<= main_~i~0 6)} assume true; {13813#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:12,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {13813#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13813#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:12,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {13813#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13814#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:12,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {13814#(<= main_~i~0 7)} assume true; {13814#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:12,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {13814#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13814#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:12,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {13814#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13815#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:12,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {13815#(<= main_~i~0 8)} assume true; {13815#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:12,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {13815#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13815#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:12,228 INFO L273 TraceCheckUtils]: 32: Hoare triple {13815#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13816#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:12,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {13816#(<= main_~i~0 9)} assume true; {13816#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:12,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {13816#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13816#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:12,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {13816#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13817#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:12,229 INFO L273 TraceCheckUtils]: 36: Hoare triple {13817#(<= main_~i~0 10)} assume true; {13817#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:12,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {13817#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13817#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:12,230 INFO L273 TraceCheckUtils]: 38: Hoare triple {13817#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13818#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:12,230 INFO L273 TraceCheckUtils]: 39: Hoare triple {13818#(<= main_~i~0 11)} assume true; {13818#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:12,230 INFO L273 TraceCheckUtils]: 40: Hoare triple {13818#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13818#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:12,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {13818#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13819#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:12,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {13819#(<= main_~i~0 12)} assume true; {13819#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:12,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {13819#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13819#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:12,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {13819#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13820#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:12,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {13820#(<= main_~i~0 13)} assume true; {13820#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:12,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {13820#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13820#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:12,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {13820#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13821#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:12,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {13821#(<= main_~i~0 14)} assume true; {13821#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:12,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {13821#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13821#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:12,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {13821#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13822#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:12,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {13822#(<= main_~i~0 15)} assume true; {13822#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:12,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {13822#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13822#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:12,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {13822#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13823#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:12,238 INFO L273 TraceCheckUtils]: 54: Hoare triple {13823#(<= main_~i~0 16)} assume true; {13823#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:12,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {13823#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13823#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:12,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {13823#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13824#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:12,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {13824#(<= main_~i~0 17)} assume true; {13824#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:12,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {13824#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13824#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:12,251 INFO L273 TraceCheckUtils]: 59: Hoare triple {13824#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13825#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:12,251 INFO L273 TraceCheckUtils]: 60: Hoare triple {13825#(<= main_~i~0 18)} assume true; {13825#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:12,251 INFO L273 TraceCheckUtils]: 61: Hoare triple {13825#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13825#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:12,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {13825#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13826#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:12,252 INFO L273 TraceCheckUtils]: 63: Hoare triple {13826#(<= main_~i~0 19)} assume true; {13826#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:12,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {13826#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13826#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:12,253 INFO L273 TraceCheckUtils]: 65: Hoare triple {13826#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13827#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:12,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {13827#(<= main_~i~0 20)} assume true; {13827#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:12,254 INFO L273 TraceCheckUtils]: 67: Hoare triple {13827#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13827#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:12,254 INFO L273 TraceCheckUtils]: 68: Hoare triple {13827#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13828#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:12,255 INFO L273 TraceCheckUtils]: 69: Hoare triple {13828#(<= main_~i~0 21)} assume true; {13828#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:12,255 INFO L273 TraceCheckUtils]: 70: Hoare triple {13828#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13828#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:12,256 INFO L273 TraceCheckUtils]: 71: Hoare triple {13828#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13829#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:12,256 INFO L273 TraceCheckUtils]: 72: Hoare triple {13829#(<= main_~i~0 22)} assume true; {13829#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:12,257 INFO L273 TraceCheckUtils]: 73: Hoare triple {13829#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13829#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:12,258 INFO L273 TraceCheckUtils]: 74: Hoare triple {13829#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13830#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:12,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {13830#(<= main_~i~0 23)} assume true; {13830#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:12,259 INFO L273 TraceCheckUtils]: 76: Hoare triple {13830#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13830#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:12,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {13830#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13831#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:12,260 INFO L273 TraceCheckUtils]: 78: Hoare triple {13831#(<= main_~i~0 24)} assume true; {13831#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:12,260 INFO L273 TraceCheckUtils]: 79: Hoare triple {13831#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13831#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:12,261 INFO L273 TraceCheckUtils]: 80: Hoare triple {13831#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13832#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:12,262 INFO L273 TraceCheckUtils]: 81: Hoare triple {13832#(<= main_~i~0 25)} assume true; {13832#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:12,262 INFO L273 TraceCheckUtils]: 82: Hoare triple {13832#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13832#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:12,263 INFO L273 TraceCheckUtils]: 83: Hoare triple {13832#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13833#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:12,263 INFO L273 TraceCheckUtils]: 84: Hoare triple {13833#(<= main_~i~0 26)} assume true; {13833#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:12,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {13833#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13833#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:12,282 INFO L273 TraceCheckUtils]: 86: Hoare triple {13833#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13834#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:12,291 INFO L273 TraceCheckUtils]: 87: Hoare triple {13834#(<= main_~i~0 27)} assume true; {13834#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:12,304 INFO L273 TraceCheckUtils]: 88: Hoare triple {13834#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13834#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:12,313 INFO L273 TraceCheckUtils]: 89: Hoare triple {13834#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13835#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:12,328 INFO L273 TraceCheckUtils]: 90: Hoare triple {13835#(<= main_~i~0 28)} assume true; {13835#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:12,336 INFO L273 TraceCheckUtils]: 91: Hoare triple {13835#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13835#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:12,351 INFO L273 TraceCheckUtils]: 92: Hoare triple {13835#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13836#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:12,359 INFO L273 TraceCheckUtils]: 93: Hoare triple {13836#(<= main_~i~0 29)} assume true; {13836#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:12,375 INFO L273 TraceCheckUtils]: 94: Hoare triple {13836#(<= main_~i~0 29)} assume !(~i~0 < 2048); {13806#false} is VALID [2018-11-14 17:33:12,375 INFO L273 TraceCheckUtils]: 95: Hoare triple {13806#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {13806#false} is VALID [2018-11-14 17:33:12,375 INFO L256 TraceCheckUtils]: 96: Hoare triple {13806#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13806#false} is VALID [2018-11-14 17:33:12,375 INFO L273 TraceCheckUtils]: 97: Hoare triple {13806#false} ~cond := #in~cond; {13806#false} is VALID [2018-11-14 17:33:12,376 INFO L273 TraceCheckUtils]: 98: Hoare triple {13806#false} assume ~cond == 0; {13806#false} is VALID [2018-11-14 17:33:12,376 INFO L273 TraceCheckUtils]: 99: Hoare triple {13806#false} assume !false; {13806#false} is VALID [2018-11-14 17:33:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:12,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:12,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:12,398 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:33:13,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 17:33:13,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:13,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:13,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {13805#true} call ULTIMATE.init(); {13805#true} is VALID [2018-11-14 17:33:13,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {13805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13805#true} is VALID [2018-11-14 17:33:13,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {13805#true} assume true; {13805#true} is VALID [2018-11-14 17:33:13,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13805#true} {13805#true} #36#return; {13805#true} is VALID [2018-11-14 17:33:13,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {13805#true} call #t~ret4 := main(); {13805#true} is VALID [2018-11-14 17:33:13,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {13805#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13855#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:13,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {13855#(<= main_~i~0 0)} assume true; {13855#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:13,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {13855#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13855#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:13,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {13855#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13808#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:13,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {13808#(<= main_~i~0 1)} assume true; {13808#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:13,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {13808#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13808#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:13,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {13808#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13809#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:13,555 INFO L273 TraceCheckUtils]: 12: Hoare triple {13809#(<= main_~i~0 2)} assume true; {13809#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:13,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {13809#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13809#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:13,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {13809#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13810#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:13,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {13810#(<= main_~i~0 3)} assume true; {13810#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:13,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {13810#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13810#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:13,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {13810#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13811#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:13,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {13811#(<= main_~i~0 4)} assume true; {13811#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:13,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {13811#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13811#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:13,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {13811#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13812#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:13,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {13812#(<= main_~i~0 5)} assume true; {13812#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:13,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {13812#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13812#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:13,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {13812#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13813#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:13,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {13813#(<= main_~i~0 6)} assume true; {13813#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:13,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {13813#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13813#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:13,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {13813#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13814#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:13,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {13814#(<= main_~i~0 7)} assume true; {13814#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:13,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {13814#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13814#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:13,565 INFO L273 TraceCheckUtils]: 29: Hoare triple {13814#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13815#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:13,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {13815#(<= main_~i~0 8)} assume true; {13815#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:13,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {13815#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13815#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:13,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {13815#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13816#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:13,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {13816#(<= main_~i~0 9)} assume true; {13816#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:13,567 INFO L273 TraceCheckUtils]: 34: Hoare triple {13816#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13816#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:13,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {13816#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13817#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:13,569 INFO L273 TraceCheckUtils]: 36: Hoare triple {13817#(<= main_~i~0 10)} assume true; {13817#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:13,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {13817#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13817#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:13,597 INFO L273 TraceCheckUtils]: 38: Hoare triple {13817#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13818#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:13,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {13818#(<= main_~i~0 11)} assume true; {13818#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:13,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {13818#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13818#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:13,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {13818#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13819#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:13,599 INFO L273 TraceCheckUtils]: 42: Hoare triple {13819#(<= main_~i~0 12)} assume true; {13819#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:13,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {13819#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13819#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:13,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {13819#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13820#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:13,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {13820#(<= main_~i~0 13)} assume true; {13820#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:13,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {13820#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13820#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:13,600 INFO L273 TraceCheckUtils]: 47: Hoare triple {13820#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13821#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:13,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {13821#(<= main_~i~0 14)} assume true; {13821#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:13,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {13821#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13821#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:13,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {13821#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13822#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:13,603 INFO L273 TraceCheckUtils]: 51: Hoare triple {13822#(<= main_~i~0 15)} assume true; {13822#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:13,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {13822#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13822#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:13,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {13822#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13823#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:13,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {13823#(<= main_~i~0 16)} assume true; {13823#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:13,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {13823#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13823#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:13,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {13823#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13824#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:13,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {13824#(<= main_~i~0 17)} assume true; {13824#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:13,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {13824#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13824#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:13,607 INFO L273 TraceCheckUtils]: 59: Hoare triple {13824#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13825#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:13,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {13825#(<= main_~i~0 18)} assume true; {13825#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:13,608 INFO L273 TraceCheckUtils]: 61: Hoare triple {13825#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13825#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:13,609 INFO L273 TraceCheckUtils]: 62: Hoare triple {13825#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13826#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:13,609 INFO L273 TraceCheckUtils]: 63: Hoare triple {13826#(<= main_~i~0 19)} assume true; {13826#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:13,610 INFO L273 TraceCheckUtils]: 64: Hoare triple {13826#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13826#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:13,611 INFO L273 TraceCheckUtils]: 65: Hoare triple {13826#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13827#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:13,611 INFO L273 TraceCheckUtils]: 66: Hoare triple {13827#(<= main_~i~0 20)} assume true; {13827#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:13,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {13827#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13827#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:13,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {13827#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13828#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:13,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {13828#(<= main_~i~0 21)} assume true; {13828#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:13,613 INFO L273 TraceCheckUtils]: 70: Hoare triple {13828#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13828#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:13,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {13828#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13829#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:13,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {13829#(<= main_~i~0 22)} assume true; {13829#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:13,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {13829#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13829#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:13,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {13829#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13830#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:13,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {13830#(<= main_~i~0 23)} assume true; {13830#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:13,617 INFO L273 TraceCheckUtils]: 76: Hoare triple {13830#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13830#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:13,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {13830#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13831#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:13,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {13831#(<= main_~i~0 24)} assume true; {13831#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:13,619 INFO L273 TraceCheckUtils]: 79: Hoare triple {13831#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13831#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:13,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {13831#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13832#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:13,620 INFO L273 TraceCheckUtils]: 81: Hoare triple {13832#(<= main_~i~0 25)} assume true; {13832#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:13,620 INFO L273 TraceCheckUtils]: 82: Hoare triple {13832#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13832#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:13,621 INFO L273 TraceCheckUtils]: 83: Hoare triple {13832#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13833#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:13,622 INFO L273 TraceCheckUtils]: 84: Hoare triple {13833#(<= main_~i~0 26)} assume true; {13833#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:13,622 INFO L273 TraceCheckUtils]: 85: Hoare triple {13833#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13833#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:13,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {13833#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13834#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:13,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {13834#(<= main_~i~0 27)} assume true; {13834#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:13,624 INFO L273 TraceCheckUtils]: 88: Hoare triple {13834#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13834#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:13,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {13834#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13835#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:13,625 INFO L273 TraceCheckUtils]: 90: Hoare triple {13835#(<= main_~i~0 28)} assume true; {13835#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:13,625 INFO L273 TraceCheckUtils]: 91: Hoare triple {13835#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13835#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:13,626 INFO L273 TraceCheckUtils]: 92: Hoare triple {13835#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13836#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:13,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {13836#(<= main_~i~0 29)} assume true; {13836#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:13,627 INFO L273 TraceCheckUtils]: 94: Hoare triple {13836#(<= main_~i~0 29)} assume !(~i~0 < 2048); {13806#false} is VALID [2018-11-14 17:33:13,627 INFO L273 TraceCheckUtils]: 95: Hoare triple {13806#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {13806#false} is VALID [2018-11-14 17:33:13,628 INFO L256 TraceCheckUtils]: 96: Hoare triple {13806#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13806#false} is VALID [2018-11-14 17:33:13,628 INFO L273 TraceCheckUtils]: 97: Hoare triple {13806#false} ~cond := #in~cond; {13806#false} is VALID [2018-11-14 17:33:13,628 INFO L273 TraceCheckUtils]: 98: Hoare triple {13806#false} assume ~cond == 0; {13806#false} is VALID [2018-11-14 17:33:13,628 INFO L273 TraceCheckUtils]: 99: Hoare triple {13806#false} assume !false; {13806#false} is VALID [2018-11-14 17:33:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:13,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:13,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 17:33:13,657 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-14 17:33:13,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:13,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 17:33:13,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:13,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 17:33:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 17:33:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:33:13,766 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 33 states. [2018-11-14 17:33:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:14,371 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-14 17:33:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 17:33:14,371 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-14 17:33:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:33:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2018-11-14 17:33:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:33:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2018-11-14 17:33:14,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 111 transitions. [2018-11-14 17:33:14,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:14,478 INFO L225 Difference]: With dead ends: 111 [2018-11-14 17:33:14,478 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 17:33:14,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:33:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 17:33:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-14 17:33:14,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:14,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-14 17:33:14,528 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-14 17:33:14,528 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-14 17:33:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:14,530 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-14 17:33:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-14 17:33:14,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:14,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:14,531 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-14 17:33:14,531 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-14 17:33:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:14,532 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-14 17:33:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-14 17:33:14,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:14,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:14,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:14,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 17:33:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-11-14 17:33:14,535 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-11-14 17:33:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:14,535 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-11-14 17:33:14,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 17:33:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-14 17:33:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 17:33:14,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:14,536 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:14,536 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:14,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash 124553219, now seen corresponding path program 30 times [2018-11-14 17:33:14,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:14,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:16,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {14638#true} call ULTIMATE.init(); {14638#true} is VALID [2018-11-14 17:33:16,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {14638#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14638#true} is VALID [2018-11-14 17:33:16,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2018-11-14 17:33:16,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #36#return; {14638#true} is VALID [2018-11-14 17:33:16,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret4 := main(); {14638#true} is VALID [2018-11-14 17:33:16,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {14638#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14640#(= main_~i~0 0)} is VALID [2018-11-14 17:33:16,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {14640#(= main_~i~0 0)} assume true; {14640#(= main_~i~0 0)} is VALID [2018-11-14 17:33:16,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {14640#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14640#(= main_~i~0 0)} is VALID [2018-11-14 17:33:16,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {14640#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14641#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:16,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {14641#(<= main_~i~0 1)} assume true; {14641#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:16,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {14641#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14641#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:16,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {14641#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14642#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:16,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {14642#(<= main_~i~0 2)} assume true; {14642#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:16,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {14642#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14642#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:16,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {14642#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14643#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:16,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {14643#(<= main_~i~0 3)} assume true; {14643#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:16,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {14643#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14643#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:16,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {14643#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14644#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:16,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {14644#(<= main_~i~0 4)} assume true; {14644#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:16,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {14644#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14644#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:16,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {14644#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14645#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:16,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {14645#(<= main_~i~0 5)} assume true; {14645#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:16,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {14645#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14645#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:16,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {14645#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14646#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:16,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {14646#(<= main_~i~0 6)} assume true; {14646#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:16,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {14646#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14646#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:16,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {14646#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14647#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:16,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {14647#(<= main_~i~0 7)} assume true; {14647#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:16,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {14647#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14647#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:16,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14648#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:16,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~i~0 8)} assume true; {14648#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:16,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {14648#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14648#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:16,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {14648#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14649#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:16,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {14649#(<= main_~i~0 9)} assume true; {14649#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:16,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {14649#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14649#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:16,363 INFO L273 TraceCheckUtils]: 35: Hoare triple {14649#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14650#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:16,364 INFO L273 TraceCheckUtils]: 36: Hoare triple {14650#(<= main_~i~0 10)} assume true; {14650#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:16,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {14650#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14650#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:16,365 INFO L273 TraceCheckUtils]: 38: Hoare triple {14650#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14651#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:16,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {14651#(<= main_~i~0 11)} assume true; {14651#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:16,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {14651#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14651#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:16,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {14651#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14652#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:16,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {14652#(<= main_~i~0 12)} assume true; {14652#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:16,368 INFO L273 TraceCheckUtils]: 43: Hoare triple {14652#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14652#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:16,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {14652#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14653#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:16,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {14653#(<= main_~i~0 13)} assume true; {14653#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:16,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {14653#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14653#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:16,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {14653#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14654#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:16,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {14654#(<= main_~i~0 14)} assume true; {14654#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:16,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {14654#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14654#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:16,372 INFO L273 TraceCheckUtils]: 50: Hoare triple {14654#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14655#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:16,372 INFO L273 TraceCheckUtils]: 51: Hoare triple {14655#(<= main_~i~0 15)} assume true; {14655#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:16,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {14655#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14655#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:16,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {14655#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14656#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:16,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {14656#(<= main_~i~0 16)} assume true; {14656#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:16,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {14656#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14656#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:16,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {14656#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14657#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:16,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {14657#(<= main_~i~0 17)} assume true; {14657#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:16,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {14657#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14657#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:16,377 INFO L273 TraceCheckUtils]: 59: Hoare triple {14657#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14658#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:16,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {14658#(<= main_~i~0 18)} assume true; {14658#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:16,378 INFO L273 TraceCheckUtils]: 61: Hoare triple {14658#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14658#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:16,378 INFO L273 TraceCheckUtils]: 62: Hoare triple {14658#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14659#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:16,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {14659#(<= main_~i~0 19)} assume true; {14659#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:16,379 INFO L273 TraceCheckUtils]: 64: Hoare triple {14659#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14659#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:16,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {14659#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14660#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:16,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {14660#(<= main_~i~0 20)} assume true; {14660#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:16,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {14660#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14660#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:16,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {14660#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14661#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:16,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {14661#(<= main_~i~0 21)} assume true; {14661#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:16,383 INFO L273 TraceCheckUtils]: 70: Hoare triple {14661#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14661#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:16,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {14661#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14662#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:16,384 INFO L273 TraceCheckUtils]: 72: Hoare triple {14662#(<= main_~i~0 22)} assume true; {14662#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:16,384 INFO L273 TraceCheckUtils]: 73: Hoare triple {14662#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14662#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:16,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {14662#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14663#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:16,385 INFO L273 TraceCheckUtils]: 75: Hoare triple {14663#(<= main_~i~0 23)} assume true; {14663#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:16,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {14663#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14663#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:16,387 INFO L273 TraceCheckUtils]: 77: Hoare triple {14663#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14664#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:16,387 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#(<= main_~i~0 24)} assume true; {14664#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:16,388 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14664#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:16,388 INFO L273 TraceCheckUtils]: 80: Hoare triple {14664#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14665#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:16,389 INFO L273 TraceCheckUtils]: 81: Hoare triple {14665#(<= main_~i~0 25)} assume true; {14665#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:16,389 INFO L273 TraceCheckUtils]: 82: Hoare triple {14665#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14665#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:16,390 INFO L273 TraceCheckUtils]: 83: Hoare triple {14665#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14666#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:16,391 INFO L273 TraceCheckUtils]: 84: Hoare triple {14666#(<= main_~i~0 26)} assume true; {14666#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:16,391 INFO L273 TraceCheckUtils]: 85: Hoare triple {14666#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14666#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:16,392 INFO L273 TraceCheckUtils]: 86: Hoare triple {14666#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14667#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:16,392 INFO L273 TraceCheckUtils]: 87: Hoare triple {14667#(<= main_~i~0 27)} assume true; {14667#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:16,393 INFO L273 TraceCheckUtils]: 88: Hoare triple {14667#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14667#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:16,394 INFO L273 TraceCheckUtils]: 89: Hoare triple {14667#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14668#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:16,394 INFO L273 TraceCheckUtils]: 90: Hoare triple {14668#(<= main_~i~0 28)} assume true; {14668#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:16,395 INFO L273 TraceCheckUtils]: 91: Hoare triple {14668#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14668#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:16,395 INFO L273 TraceCheckUtils]: 92: Hoare triple {14668#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14669#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:16,396 INFO L273 TraceCheckUtils]: 93: Hoare triple {14669#(<= main_~i~0 29)} assume true; {14669#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:16,396 INFO L273 TraceCheckUtils]: 94: Hoare triple {14669#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14669#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:16,397 INFO L273 TraceCheckUtils]: 95: Hoare triple {14669#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14670#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:16,397 INFO L273 TraceCheckUtils]: 96: Hoare triple {14670#(<= main_~i~0 30)} assume true; {14670#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:16,398 INFO L273 TraceCheckUtils]: 97: Hoare triple {14670#(<= main_~i~0 30)} assume !(~i~0 < 2048); {14639#false} is VALID [2018-11-14 17:33:16,398 INFO L273 TraceCheckUtils]: 98: Hoare triple {14639#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {14639#false} is VALID [2018-11-14 17:33:16,399 INFO L256 TraceCheckUtils]: 99: Hoare triple {14639#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14639#false} is VALID [2018-11-14 17:33:16,399 INFO L273 TraceCheckUtils]: 100: Hoare triple {14639#false} ~cond := #in~cond; {14639#false} is VALID [2018-11-14 17:33:16,399 INFO L273 TraceCheckUtils]: 101: Hoare triple {14639#false} assume ~cond == 0; {14639#false} is VALID [2018-11-14 17:33:16,399 INFO L273 TraceCheckUtils]: 102: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2018-11-14 17:33:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:16,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:33:28,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-14 17:33:28,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:28,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:28,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {14638#true} call ULTIMATE.init(); {14638#true} is VALID [2018-11-14 17:33:28,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {14638#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14638#true} is VALID [2018-11-14 17:33:28,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2018-11-14 17:33:28,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #36#return; {14638#true} is VALID [2018-11-14 17:33:28,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret4 := main(); {14638#true} is VALID [2018-11-14 17:33:29,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {14638#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14689#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:29,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {14689#(<= main_~i~0 0)} assume true; {14689#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:29,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {14689#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14689#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:29,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {14689#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14641#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:29,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {14641#(<= main_~i~0 1)} assume true; {14641#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:29,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {14641#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14641#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:29,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {14641#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14642#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:29,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {14642#(<= main_~i~0 2)} assume true; {14642#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:29,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {14642#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14642#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:29,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {14642#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14643#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:29,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {14643#(<= main_~i~0 3)} assume true; {14643#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:29,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {14643#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14643#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:29,005 INFO L273 TraceCheckUtils]: 17: Hoare triple {14643#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14644#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:29,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {14644#(<= main_~i~0 4)} assume true; {14644#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:29,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {14644#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14644#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:29,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {14644#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14645#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:29,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {14645#(<= main_~i~0 5)} assume true; {14645#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:29,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {14645#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14645#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:29,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {14645#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14646#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:29,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {14646#(<= main_~i~0 6)} assume true; {14646#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:29,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {14646#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14646#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:29,010 INFO L273 TraceCheckUtils]: 26: Hoare triple {14646#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14647#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:29,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {14647#(<= main_~i~0 7)} assume true; {14647#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:29,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {14647#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14647#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:29,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14648#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:29,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~i~0 8)} assume true; {14648#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:29,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {14648#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14648#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:29,014 INFO L273 TraceCheckUtils]: 32: Hoare triple {14648#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14649#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:29,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {14649#(<= main_~i~0 9)} assume true; {14649#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:29,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {14649#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14649#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:29,016 INFO L273 TraceCheckUtils]: 35: Hoare triple {14649#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14650#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:29,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {14650#(<= main_~i~0 10)} assume true; {14650#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:29,017 INFO L273 TraceCheckUtils]: 37: Hoare triple {14650#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14650#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:29,017 INFO L273 TraceCheckUtils]: 38: Hoare triple {14650#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14651#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:29,018 INFO L273 TraceCheckUtils]: 39: Hoare triple {14651#(<= main_~i~0 11)} assume true; {14651#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:29,018 INFO L273 TraceCheckUtils]: 40: Hoare triple {14651#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14651#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:29,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {14651#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14652#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:29,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {14652#(<= main_~i~0 12)} assume true; {14652#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:29,020 INFO L273 TraceCheckUtils]: 43: Hoare triple {14652#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14652#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:29,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {14652#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14653#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:29,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {14653#(<= main_~i~0 13)} assume true; {14653#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:29,022 INFO L273 TraceCheckUtils]: 46: Hoare triple {14653#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14653#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:29,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {14653#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14654#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:29,023 INFO L273 TraceCheckUtils]: 48: Hoare triple {14654#(<= main_~i~0 14)} assume true; {14654#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:29,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {14654#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14654#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:29,024 INFO L273 TraceCheckUtils]: 50: Hoare triple {14654#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14655#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:29,025 INFO L273 TraceCheckUtils]: 51: Hoare triple {14655#(<= main_~i~0 15)} assume true; {14655#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:29,025 INFO L273 TraceCheckUtils]: 52: Hoare triple {14655#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14655#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:29,026 INFO L273 TraceCheckUtils]: 53: Hoare triple {14655#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14656#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:29,026 INFO L273 TraceCheckUtils]: 54: Hoare triple {14656#(<= main_~i~0 16)} assume true; {14656#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:29,027 INFO L273 TraceCheckUtils]: 55: Hoare triple {14656#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14656#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:29,028 INFO L273 TraceCheckUtils]: 56: Hoare triple {14656#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14657#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:29,028 INFO L273 TraceCheckUtils]: 57: Hoare triple {14657#(<= main_~i~0 17)} assume true; {14657#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:29,029 INFO L273 TraceCheckUtils]: 58: Hoare triple {14657#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14657#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:29,029 INFO L273 TraceCheckUtils]: 59: Hoare triple {14657#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14658#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:29,030 INFO L273 TraceCheckUtils]: 60: Hoare triple {14658#(<= main_~i~0 18)} assume true; {14658#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:29,030 INFO L273 TraceCheckUtils]: 61: Hoare triple {14658#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14658#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:29,031 INFO L273 TraceCheckUtils]: 62: Hoare triple {14658#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14659#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:29,031 INFO L273 TraceCheckUtils]: 63: Hoare triple {14659#(<= main_~i~0 19)} assume true; {14659#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:29,032 INFO L273 TraceCheckUtils]: 64: Hoare triple {14659#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14659#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:29,033 INFO L273 TraceCheckUtils]: 65: Hoare triple {14659#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14660#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:29,033 INFO L273 TraceCheckUtils]: 66: Hoare triple {14660#(<= main_~i~0 20)} assume true; {14660#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:29,034 INFO L273 TraceCheckUtils]: 67: Hoare triple {14660#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14660#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:29,034 INFO L273 TraceCheckUtils]: 68: Hoare triple {14660#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14661#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:29,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {14661#(<= main_~i~0 21)} assume true; {14661#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:29,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {14661#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14661#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:29,036 INFO L273 TraceCheckUtils]: 71: Hoare triple {14661#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14662#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:29,037 INFO L273 TraceCheckUtils]: 72: Hoare triple {14662#(<= main_~i~0 22)} assume true; {14662#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:29,037 INFO L273 TraceCheckUtils]: 73: Hoare triple {14662#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14662#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:29,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {14662#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14663#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:29,038 INFO L273 TraceCheckUtils]: 75: Hoare triple {14663#(<= main_~i~0 23)} assume true; {14663#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:29,039 INFO L273 TraceCheckUtils]: 76: Hoare triple {14663#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14663#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:29,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {14663#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14664#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:29,040 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#(<= main_~i~0 24)} assume true; {14664#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:29,041 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14664#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:29,041 INFO L273 TraceCheckUtils]: 80: Hoare triple {14664#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14665#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:29,042 INFO L273 TraceCheckUtils]: 81: Hoare triple {14665#(<= main_~i~0 25)} assume true; {14665#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:29,042 INFO L273 TraceCheckUtils]: 82: Hoare triple {14665#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14665#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:29,043 INFO L273 TraceCheckUtils]: 83: Hoare triple {14665#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14666#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:29,043 INFO L273 TraceCheckUtils]: 84: Hoare triple {14666#(<= main_~i~0 26)} assume true; {14666#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:29,044 INFO L273 TraceCheckUtils]: 85: Hoare triple {14666#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14666#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:29,045 INFO L273 TraceCheckUtils]: 86: Hoare triple {14666#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14667#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:29,045 INFO L273 TraceCheckUtils]: 87: Hoare triple {14667#(<= main_~i~0 27)} assume true; {14667#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:29,046 INFO L273 TraceCheckUtils]: 88: Hoare triple {14667#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14667#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:29,046 INFO L273 TraceCheckUtils]: 89: Hoare triple {14667#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14668#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:29,047 INFO L273 TraceCheckUtils]: 90: Hoare triple {14668#(<= main_~i~0 28)} assume true; {14668#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:29,047 INFO L273 TraceCheckUtils]: 91: Hoare triple {14668#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14668#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:29,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {14668#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14669#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:29,049 INFO L273 TraceCheckUtils]: 93: Hoare triple {14669#(<= main_~i~0 29)} assume true; {14669#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:29,049 INFO L273 TraceCheckUtils]: 94: Hoare triple {14669#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14669#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:29,050 INFO L273 TraceCheckUtils]: 95: Hoare triple {14669#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14670#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:29,050 INFO L273 TraceCheckUtils]: 96: Hoare triple {14670#(<= main_~i~0 30)} assume true; {14670#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:29,051 INFO L273 TraceCheckUtils]: 97: Hoare triple {14670#(<= main_~i~0 30)} assume !(~i~0 < 2048); {14639#false} is VALID [2018-11-14 17:33:29,051 INFO L273 TraceCheckUtils]: 98: Hoare triple {14639#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {14639#false} is VALID [2018-11-14 17:33:29,051 INFO L256 TraceCheckUtils]: 99: Hoare triple {14639#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14639#false} is VALID [2018-11-14 17:33:29,052 INFO L273 TraceCheckUtils]: 100: Hoare triple {14639#false} ~cond := #in~cond; {14639#false} is VALID [2018-11-14 17:33:29,052 INFO L273 TraceCheckUtils]: 101: Hoare triple {14639#false} assume ~cond == 0; {14639#false} is VALID [2018-11-14 17:33:29,052 INFO L273 TraceCheckUtils]: 102: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2018-11-14 17:33:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:29,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:29,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 17:33:29,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-14 17:33:29,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:29,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:33:29,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:29,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:33:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:33:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:33:29,641 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 34 states. [2018-11-14 17:33:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:30,292 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-14 17:33:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 17:33:30,293 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-14 17:33:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:33:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 114 transitions. [2018-11-14 17:33:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:33:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 114 transitions. [2018-11-14 17:33:30,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 114 transitions. [2018-11-14 17:33:30,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:30,401 INFO L225 Difference]: With dead ends: 114 [2018-11-14 17:33:30,401 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 17:33:30,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:33:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 17:33:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-14 17:33:30,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:30,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-14 17:33:30,428 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-14 17:33:30,428 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-14 17:33:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:30,429 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-14 17:33:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-14 17:33:30,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:30,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:30,430 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-14 17:33:30,430 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-14 17:33:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:30,432 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-14 17:33:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-14 17:33:30,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:30,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:30,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:30,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 17:33:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-14 17:33:30,434 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-11-14 17:33:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:30,435 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-14 17:33:30,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:33:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-14 17:33:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 17:33:30,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:30,436 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:30,436 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:30,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash 806955834, now seen corresponding path program 31 times [2018-11-14 17:33:30,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:30,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:30,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:31,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {15495#true} call ULTIMATE.init(); {15495#true} is VALID [2018-11-14 17:33:31,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {15495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15495#true} is VALID [2018-11-14 17:33:31,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {15495#true} assume true; {15495#true} is VALID [2018-11-14 17:33:31,101 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15495#true} {15495#true} #36#return; {15495#true} is VALID [2018-11-14 17:33:31,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {15495#true} call #t~ret4 := main(); {15495#true} is VALID [2018-11-14 17:33:31,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {15495#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15497#(= main_~i~0 0)} is VALID [2018-11-14 17:33:31,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {15497#(= main_~i~0 0)} assume true; {15497#(= main_~i~0 0)} is VALID [2018-11-14 17:33:31,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {15497#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15497#(= main_~i~0 0)} is VALID [2018-11-14 17:33:31,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {15497#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15498#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:31,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {15498#(<= main_~i~0 1)} assume true; {15498#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:31,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {15498#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15498#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:31,105 INFO L273 TraceCheckUtils]: 11: Hoare triple {15498#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15499#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:31,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {15499#(<= main_~i~0 2)} assume true; {15499#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:31,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {15499#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15499#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:31,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {15499#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15500#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:31,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {15500#(<= main_~i~0 3)} assume true; {15500#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:31,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {15500#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15500#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:31,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {15500#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15501#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:31,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {15501#(<= main_~i~0 4)} assume true; {15501#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:31,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {15501#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15501#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:31,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {15501#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15502#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:31,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {15502#(<= main_~i~0 5)} assume true; {15502#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:31,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {15502#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15502#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:31,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {15502#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15503#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:31,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {15503#(<= main_~i~0 6)} assume true; {15503#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:31,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {15503#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15503#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:31,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {15503#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15504#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:31,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {15504#(<= main_~i~0 7)} assume true; {15504#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:31,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {15504#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15504#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:31,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {15504#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15505#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:31,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {15505#(<= main_~i~0 8)} assume true; {15505#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:31,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {15505#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15505#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:31,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {15505#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15506#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:31,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {15506#(<= main_~i~0 9)} assume true; {15506#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:31,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {15506#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15506#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:31,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {15506#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15507#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:31,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {15507#(<= main_~i~0 10)} assume true; {15507#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:31,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {15507#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15507#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:31,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {15507#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15508#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:31,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {15508#(<= main_~i~0 11)} assume true; {15508#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:31,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {15508#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15508#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:31,141 INFO L273 TraceCheckUtils]: 41: Hoare triple {15508#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15509#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:31,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {15509#(<= main_~i~0 12)} assume true; {15509#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:31,143 INFO L273 TraceCheckUtils]: 43: Hoare triple {15509#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15509#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:31,143 INFO L273 TraceCheckUtils]: 44: Hoare triple {15509#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15510#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:31,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {15510#(<= main_~i~0 13)} assume true; {15510#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:31,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {15510#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15510#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:31,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {15510#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15511#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:31,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {15511#(<= main_~i~0 14)} assume true; {15511#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:31,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {15511#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15511#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:31,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {15511#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15512#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:31,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {15512#(<= main_~i~0 15)} assume true; {15512#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:31,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {15512#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15512#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:31,154 INFO L273 TraceCheckUtils]: 53: Hoare triple {15512#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15513#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:31,154 INFO L273 TraceCheckUtils]: 54: Hoare triple {15513#(<= main_~i~0 16)} assume true; {15513#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:31,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {15513#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15513#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:31,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {15513#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15514#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:31,159 INFO L273 TraceCheckUtils]: 57: Hoare triple {15514#(<= main_~i~0 17)} assume true; {15514#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:31,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {15514#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15514#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:31,161 INFO L273 TraceCheckUtils]: 59: Hoare triple {15514#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15515#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:31,161 INFO L273 TraceCheckUtils]: 60: Hoare triple {15515#(<= main_~i~0 18)} assume true; {15515#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:31,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {15515#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15515#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:31,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {15515#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15516#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:31,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {15516#(<= main_~i~0 19)} assume true; {15516#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:31,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {15516#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15516#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:31,168 INFO L273 TraceCheckUtils]: 65: Hoare triple {15516#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15517#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:31,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {15517#(<= main_~i~0 20)} assume true; {15517#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:31,170 INFO L273 TraceCheckUtils]: 67: Hoare triple {15517#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15517#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:31,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {15517#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15518#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:31,172 INFO L273 TraceCheckUtils]: 69: Hoare triple {15518#(<= main_~i~0 21)} assume true; {15518#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:31,172 INFO L273 TraceCheckUtils]: 70: Hoare triple {15518#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15518#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:31,174 INFO L273 TraceCheckUtils]: 71: Hoare triple {15518#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15519#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:31,174 INFO L273 TraceCheckUtils]: 72: Hoare triple {15519#(<= main_~i~0 22)} assume true; {15519#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:31,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {15519#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15519#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:31,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {15519#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15520#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:31,178 INFO L273 TraceCheckUtils]: 75: Hoare triple {15520#(<= main_~i~0 23)} assume true; {15520#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:31,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {15520#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15520#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:31,181 INFO L273 TraceCheckUtils]: 77: Hoare triple {15520#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15521#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:31,181 INFO L273 TraceCheckUtils]: 78: Hoare triple {15521#(<= main_~i~0 24)} assume true; {15521#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:31,183 INFO L273 TraceCheckUtils]: 79: Hoare triple {15521#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15521#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:31,183 INFO L273 TraceCheckUtils]: 80: Hoare triple {15521#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15522#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:31,186 INFO L273 TraceCheckUtils]: 81: Hoare triple {15522#(<= main_~i~0 25)} assume true; {15522#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:31,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {15522#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15522#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:31,188 INFO L273 TraceCheckUtils]: 83: Hoare triple {15522#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15523#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:31,188 INFO L273 TraceCheckUtils]: 84: Hoare triple {15523#(<= main_~i~0 26)} assume true; {15523#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:31,190 INFO L273 TraceCheckUtils]: 85: Hoare triple {15523#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15523#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:31,190 INFO L273 TraceCheckUtils]: 86: Hoare triple {15523#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15524#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:31,192 INFO L273 TraceCheckUtils]: 87: Hoare triple {15524#(<= main_~i~0 27)} assume true; {15524#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:31,192 INFO L273 TraceCheckUtils]: 88: Hoare triple {15524#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15524#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:31,194 INFO L273 TraceCheckUtils]: 89: Hoare triple {15524#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15525#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:31,194 INFO L273 TraceCheckUtils]: 90: Hoare triple {15525#(<= main_~i~0 28)} assume true; {15525#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:31,196 INFO L273 TraceCheckUtils]: 91: Hoare triple {15525#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15525#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:31,196 INFO L273 TraceCheckUtils]: 92: Hoare triple {15525#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15526#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:31,198 INFO L273 TraceCheckUtils]: 93: Hoare triple {15526#(<= main_~i~0 29)} assume true; {15526#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:31,198 INFO L273 TraceCheckUtils]: 94: Hoare triple {15526#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15526#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:31,200 INFO L273 TraceCheckUtils]: 95: Hoare triple {15526#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15527#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:31,200 INFO L273 TraceCheckUtils]: 96: Hoare triple {15527#(<= main_~i~0 30)} assume true; {15527#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:31,202 INFO L273 TraceCheckUtils]: 97: Hoare triple {15527#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15527#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:31,202 INFO L273 TraceCheckUtils]: 98: Hoare triple {15527#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15528#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:31,205 INFO L273 TraceCheckUtils]: 99: Hoare triple {15528#(<= main_~i~0 31)} assume true; {15528#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:31,205 INFO L273 TraceCheckUtils]: 100: Hoare triple {15528#(<= main_~i~0 31)} assume !(~i~0 < 2048); {15496#false} is VALID [2018-11-14 17:33:31,205 INFO L273 TraceCheckUtils]: 101: Hoare triple {15496#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {15496#false} is VALID [2018-11-14 17:33:31,205 INFO L256 TraceCheckUtils]: 102: Hoare triple {15496#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15496#false} is VALID [2018-11-14 17:33:31,205 INFO L273 TraceCheckUtils]: 103: Hoare triple {15496#false} ~cond := #in~cond; {15496#false} is VALID [2018-11-14 17:33:31,205 INFO L273 TraceCheckUtils]: 104: Hoare triple {15496#false} assume ~cond == 0; {15496#false} is VALID [2018-11-14 17:33:31,206 INFO L273 TraceCheckUtils]: 105: Hoare triple {15496#false} assume !false; {15496#false} is VALID [2018-11-14 17:33:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:31,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:31,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:31,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:31,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:31,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {15495#true} call ULTIMATE.init(); {15495#true} is VALID [2018-11-14 17:33:31,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {15495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15495#true} is VALID [2018-11-14 17:33:31,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {15495#true} assume true; {15495#true} is VALID [2018-11-14 17:33:31,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15495#true} {15495#true} #36#return; {15495#true} is VALID [2018-11-14 17:33:31,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {15495#true} call #t~ret4 := main(); {15495#true} is VALID [2018-11-14 17:33:31,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {15495#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15547#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:31,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {15547#(<= main_~i~0 0)} assume true; {15547#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:31,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {15547#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15547#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:31,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {15547#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15498#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:31,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {15498#(<= main_~i~0 1)} assume true; {15498#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:31,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {15498#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15498#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:31,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {15498#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15499#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:31,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {15499#(<= main_~i~0 2)} assume true; {15499#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:31,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {15499#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15499#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:31,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {15499#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15500#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:31,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {15500#(<= main_~i~0 3)} assume true; {15500#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:31,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {15500#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15500#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:31,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {15500#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15501#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:31,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {15501#(<= main_~i~0 4)} assume true; {15501#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:31,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {15501#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15501#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:31,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {15501#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15502#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:31,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {15502#(<= main_~i~0 5)} assume true; {15502#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:31,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {15502#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15502#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:31,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {15502#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15503#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:31,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {15503#(<= main_~i~0 6)} assume true; {15503#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:31,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {15503#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15503#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:31,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {15503#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15504#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:31,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {15504#(<= main_~i~0 7)} assume true; {15504#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:31,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {15504#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15504#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:31,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {15504#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15505#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:31,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {15505#(<= main_~i~0 8)} assume true; {15505#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:31,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {15505#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15505#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:31,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {15505#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15506#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:31,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {15506#(<= main_~i~0 9)} assume true; {15506#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:31,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {15506#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15506#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:31,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {15506#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15507#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:31,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {15507#(<= main_~i~0 10)} assume true; {15507#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:31,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {15507#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15507#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:31,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {15507#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15508#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:31,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {15508#(<= main_~i~0 11)} assume true; {15508#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:31,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {15508#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15508#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:31,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {15508#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15509#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:31,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {15509#(<= main_~i~0 12)} assume true; {15509#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:31,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {15509#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15509#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:31,719 INFO L273 TraceCheckUtils]: 44: Hoare triple {15509#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15510#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:31,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {15510#(<= main_~i~0 13)} assume true; {15510#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:31,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {15510#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15510#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:31,721 INFO L273 TraceCheckUtils]: 47: Hoare triple {15510#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15511#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:31,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {15511#(<= main_~i~0 14)} assume true; {15511#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:31,722 INFO L273 TraceCheckUtils]: 49: Hoare triple {15511#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15511#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:31,723 INFO L273 TraceCheckUtils]: 50: Hoare triple {15511#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15512#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:31,724 INFO L273 TraceCheckUtils]: 51: Hoare triple {15512#(<= main_~i~0 15)} assume true; {15512#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:31,724 INFO L273 TraceCheckUtils]: 52: Hoare triple {15512#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15512#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:31,725 INFO L273 TraceCheckUtils]: 53: Hoare triple {15512#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15513#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:31,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {15513#(<= main_~i~0 16)} assume true; {15513#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:31,726 INFO L273 TraceCheckUtils]: 55: Hoare triple {15513#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15513#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:31,727 INFO L273 TraceCheckUtils]: 56: Hoare triple {15513#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15514#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:31,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {15514#(<= main_~i~0 17)} assume true; {15514#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:31,728 INFO L273 TraceCheckUtils]: 58: Hoare triple {15514#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15514#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:31,729 INFO L273 TraceCheckUtils]: 59: Hoare triple {15514#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15515#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:31,730 INFO L273 TraceCheckUtils]: 60: Hoare triple {15515#(<= main_~i~0 18)} assume true; {15515#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:31,730 INFO L273 TraceCheckUtils]: 61: Hoare triple {15515#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15515#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:31,731 INFO L273 TraceCheckUtils]: 62: Hoare triple {15515#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15516#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:31,732 INFO L273 TraceCheckUtils]: 63: Hoare triple {15516#(<= main_~i~0 19)} assume true; {15516#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:31,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {15516#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15516#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:31,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {15516#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15517#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:31,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {15517#(<= main_~i~0 20)} assume true; {15517#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:31,734 INFO L273 TraceCheckUtils]: 67: Hoare triple {15517#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15517#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:31,735 INFO L273 TraceCheckUtils]: 68: Hoare triple {15517#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15518#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:31,736 INFO L273 TraceCheckUtils]: 69: Hoare triple {15518#(<= main_~i~0 21)} assume true; {15518#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:31,736 INFO L273 TraceCheckUtils]: 70: Hoare triple {15518#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15518#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:31,737 INFO L273 TraceCheckUtils]: 71: Hoare triple {15518#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15519#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:31,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {15519#(<= main_~i~0 22)} assume true; {15519#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:31,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {15519#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15519#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:31,739 INFO L273 TraceCheckUtils]: 74: Hoare triple {15519#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15520#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:31,740 INFO L273 TraceCheckUtils]: 75: Hoare triple {15520#(<= main_~i~0 23)} assume true; {15520#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:31,740 INFO L273 TraceCheckUtils]: 76: Hoare triple {15520#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15520#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:31,741 INFO L273 TraceCheckUtils]: 77: Hoare triple {15520#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15521#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:31,742 INFO L273 TraceCheckUtils]: 78: Hoare triple {15521#(<= main_~i~0 24)} assume true; {15521#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:31,742 INFO L273 TraceCheckUtils]: 79: Hoare triple {15521#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15521#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:31,743 INFO L273 TraceCheckUtils]: 80: Hoare triple {15521#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15522#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:31,744 INFO L273 TraceCheckUtils]: 81: Hoare triple {15522#(<= main_~i~0 25)} assume true; {15522#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:31,744 INFO L273 TraceCheckUtils]: 82: Hoare triple {15522#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15522#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:31,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {15522#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15523#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:31,746 INFO L273 TraceCheckUtils]: 84: Hoare triple {15523#(<= main_~i~0 26)} assume true; {15523#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:31,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {15523#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15523#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:31,747 INFO L273 TraceCheckUtils]: 86: Hoare triple {15523#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15524#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:31,748 INFO L273 TraceCheckUtils]: 87: Hoare triple {15524#(<= main_~i~0 27)} assume true; {15524#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:31,748 INFO L273 TraceCheckUtils]: 88: Hoare triple {15524#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15524#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:31,749 INFO L273 TraceCheckUtils]: 89: Hoare triple {15524#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15525#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:31,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {15525#(<= main_~i~0 28)} assume true; {15525#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:31,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {15525#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15525#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:31,751 INFO L273 TraceCheckUtils]: 92: Hoare triple {15525#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15526#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:31,751 INFO L273 TraceCheckUtils]: 93: Hoare triple {15526#(<= main_~i~0 29)} assume true; {15526#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:31,752 INFO L273 TraceCheckUtils]: 94: Hoare triple {15526#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15526#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:31,753 INFO L273 TraceCheckUtils]: 95: Hoare triple {15526#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15527#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:31,753 INFO L273 TraceCheckUtils]: 96: Hoare triple {15527#(<= main_~i~0 30)} assume true; {15527#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:31,754 INFO L273 TraceCheckUtils]: 97: Hoare triple {15527#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15527#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:31,755 INFO L273 TraceCheckUtils]: 98: Hoare triple {15527#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15528#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:31,755 INFO L273 TraceCheckUtils]: 99: Hoare triple {15528#(<= main_~i~0 31)} assume true; {15528#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:31,756 INFO L273 TraceCheckUtils]: 100: Hoare triple {15528#(<= main_~i~0 31)} assume !(~i~0 < 2048); {15496#false} is VALID [2018-11-14 17:33:31,756 INFO L273 TraceCheckUtils]: 101: Hoare triple {15496#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {15496#false} is VALID [2018-11-14 17:33:31,757 INFO L256 TraceCheckUtils]: 102: Hoare triple {15496#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15496#false} is VALID [2018-11-14 17:33:31,757 INFO L273 TraceCheckUtils]: 103: Hoare triple {15496#false} ~cond := #in~cond; {15496#false} is VALID [2018-11-14 17:33:31,757 INFO L273 TraceCheckUtils]: 104: Hoare triple {15496#false} assume ~cond == 0; {15496#false} is VALID [2018-11-14 17:33:31,757 INFO L273 TraceCheckUtils]: 105: Hoare triple {15496#false} assume !false; {15496#false} is VALID [2018-11-14 17:33:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:31,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:31,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-14 17:33:31,791 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-14 17:33:31,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:31,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 17:33:31,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:31,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 17:33:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 17:33:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:33:31,983 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 35 states. [2018-11-14 17:33:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:32,440 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-14 17:33:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:33:32,441 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-14 17:33:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:33:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-14 17:33:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:33:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-14 17:33:32,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-14 17:33:32,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:32,599 INFO L225 Difference]: With dead ends: 117 [2018-11-14 17:33:32,599 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 17:33:32,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:33:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 17:33:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-14 17:33:32,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:32,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 110 states. [2018-11-14 17:33:32,626 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 110 states. [2018-11-14 17:33:32,626 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 110 states. [2018-11-14 17:33:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:32,628 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-14 17:33:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-14 17:33:32,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:32,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:32,629 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 111 states. [2018-11-14 17:33:32,629 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 111 states. [2018-11-14 17:33:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:32,631 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-14 17:33:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-14 17:33:32,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:32,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:32,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:32,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 17:33:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-11-14 17:33:32,633 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-11-14 17:33:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:32,633 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-11-14 17:33:32,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 17:33:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-11-14 17:33:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:33:32,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:32,634 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:32,634 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:32,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2111919965, now seen corresponding path program 32 times [2018-11-14 17:33:32,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:32,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:33,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {16376#true} call ULTIMATE.init(); {16376#true} is VALID [2018-11-14 17:33:33,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {16376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16376#true} is VALID [2018-11-14 17:33:33,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {16376#true} assume true; {16376#true} is VALID [2018-11-14 17:33:33,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16376#true} {16376#true} #36#return; {16376#true} is VALID [2018-11-14 17:33:33,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {16376#true} call #t~ret4 := main(); {16376#true} is VALID [2018-11-14 17:33:33,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {16376#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16378#(= main_~i~0 0)} is VALID [2018-11-14 17:33:33,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {16378#(= main_~i~0 0)} assume true; {16378#(= main_~i~0 0)} is VALID [2018-11-14 17:33:33,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {16378#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16378#(= main_~i~0 0)} is VALID [2018-11-14 17:33:33,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {16378#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16379#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:33,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {16379#(<= main_~i~0 1)} assume true; {16379#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:33,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {16379#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16379#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:33,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {16379#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16380#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:33,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {16380#(<= main_~i~0 2)} assume true; {16380#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:33,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {16380#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16380#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:33,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {16380#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16381#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:33,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {16381#(<= main_~i~0 3)} assume true; {16381#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:33,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {16381#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16381#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:33,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {16381#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16382#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:33,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {16382#(<= main_~i~0 4)} assume true; {16382#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:33,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {16382#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16382#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:33,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {16382#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16383#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:33,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {16383#(<= main_~i~0 5)} assume true; {16383#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:33,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {16383#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16383#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:33,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {16383#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16384#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:33,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {16384#(<= main_~i~0 6)} assume true; {16384#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:33,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {16384#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16384#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:33,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {16384#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16385#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:33,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {16385#(<= main_~i~0 7)} assume true; {16385#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:33,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {16385#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16385#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:33,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {16385#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16386#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:33,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {16386#(<= main_~i~0 8)} assume true; {16386#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:33,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {16386#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16386#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:33,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {16386#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16387#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:33,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {16387#(<= main_~i~0 9)} assume true; {16387#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:33,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {16387#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16387#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:33,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {16387#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16388#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:33,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {16388#(<= main_~i~0 10)} assume true; {16388#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:33,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {16388#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16388#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:33,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {16388#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16389#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:33,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {16389#(<= main_~i~0 11)} assume true; {16389#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:33,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {16389#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16389#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:33,341 INFO L273 TraceCheckUtils]: 41: Hoare triple {16389#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16390#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:33,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {16390#(<= main_~i~0 12)} assume true; {16390#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:33,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {16390#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16390#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:33,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {16390#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16391#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:33,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {16391#(<= main_~i~0 13)} assume true; {16391#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:33,344 INFO L273 TraceCheckUtils]: 46: Hoare triple {16391#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16391#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:33,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {16391#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16392#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:33,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {16392#(<= main_~i~0 14)} assume true; {16392#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:33,346 INFO L273 TraceCheckUtils]: 49: Hoare triple {16392#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16392#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:33,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {16392#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16393#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:33,347 INFO L273 TraceCheckUtils]: 51: Hoare triple {16393#(<= main_~i~0 15)} assume true; {16393#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:33,347 INFO L273 TraceCheckUtils]: 52: Hoare triple {16393#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16393#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:33,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {16393#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16394#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:33,348 INFO L273 TraceCheckUtils]: 54: Hoare triple {16394#(<= main_~i~0 16)} assume true; {16394#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:33,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {16394#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16394#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:33,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {16394#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16395#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:33,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {16395#(<= main_~i~0 17)} assume true; {16395#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:33,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {16395#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16395#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:33,351 INFO L273 TraceCheckUtils]: 59: Hoare triple {16395#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16396#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:33,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {16396#(<= main_~i~0 18)} assume true; {16396#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:33,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {16396#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16396#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:33,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {16396#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16397#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:33,354 INFO L273 TraceCheckUtils]: 63: Hoare triple {16397#(<= main_~i~0 19)} assume true; {16397#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:33,354 INFO L273 TraceCheckUtils]: 64: Hoare triple {16397#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16397#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:33,355 INFO L273 TraceCheckUtils]: 65: Hoare triple {16397#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16398#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:33,355 INFO L273 TraceCheckUtils]: 66: Hoare triple {16398#(<= main_~i~0 20)} assume true; {16398#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:33,356 INFO L273 TraceCheckUtils]: 67: Hoare triple {16398#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16398#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:33,357 INFO L273 TraceCheckUtils]: 68: Hoare triple {16398#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16399#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:33,357 INFO L273 TraceCheckUtils]: 69: Hoare triple {16399#(<= main_~i~0 21)} assume true; {16399#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:33,357 INFO L273 TraceCheckUtils]: 70: Hoare triple {16399#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16399#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:33,358 INFO L273 TraceCheckUtils]: 71: Hoare triple {16399#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16400#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:33,359 INFO L273 TraceCheckUtils]: 72: Hoare triple {16400#(<= main_~i~0 22)} assume true; {16400#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:33,359 INFO L273 TraceCheckUtils]: 73: Hoare triple {16400#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16400#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:33,360 INFO L273 TraceCheckUtils]: 74: Hoare triple {16400#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16401#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:33,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {16401#(<= main_~i~0 23)} assume true; {16401#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:33,361 INFO L273 TraceCheckUtils]: 76: Hoare triple {16401#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16401#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:33,362 INFO L273 TraceCheckUtils]: 77: Hoare triple {16401#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16402#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:33,362 INFO L273 TraceCheckUtils]: 78: Hoare triple {16402#(<= main_~i~0 24)} assume true; {16402#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:33,363 INFO L273 TraceCheckUtils]: 79: Hoare triple {16402#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16402#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:33,363 INFO L273 TraceCheckUtils]: 80: Hoare triple {16402#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16403#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:33,364 INFO L273 TraceCheckUtils]: 81: Hoare triple {16403#(<= main_~i~0 25)} assume true; {16403#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:33,364 INFO L273 TraceCheckUtils]: 82: Hoare triple {16403#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16403#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:33,365 INFO L273 TraceCheckUtils]: 83: Hoare triple {16403#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16404#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:33,366 INFO L273 TraceCheckUtils]: 84: Hoare triple {16404#(<= main_~i~0 26)} assume true; {16404#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:33,366 INFO L273 TraceCheckUtils]: 85: Hoare triple {16404#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16404#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:33,367 INFO L273 TraceCheckUtils]: 86: Hoare triple {16404#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16405#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:33,367 INFO L273 TraceCheckUtils]: 87: Hoare triple {16405#(<= main_~i~0 27)} assume true; {16405#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:33,368 INFO L273 TraceCheckUtils]: 88: Hoare triple {16405#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16405#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:33,368 INFO L273 TraceCheckUtils]: 89: Hoare triple {16405#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16406#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:33,369 INFO L273 TraceCheckUtils]: 90: Hoare triple {16406#(<= main_~i~0 28)} assume true; {16406#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:33,370 INFO L273 TraceCheckUtils]: 91: Hoare triple {16406#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16406#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:33,370 INFO L273 TraceCheckUtils]: 92: Hoare triple {16406#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16407#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:33,371 INFO L273 TraceCheckUtils]: 93: Hoare triple {16407#(<= main_~i~0 29)} assume true; {16407#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:33,371 INFO L273 TraceCheckUtils]: 94: Hoare triple {16407#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16407#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:33,372 INFO L273 TraceCheckUtils]: 95: Hoare triple {16407#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16408#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:33,372 INFO L273 TraceCheckUtils]: 96: Hoare triple {16408#(<= main_~i~0 30)} assume true; {16408#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:33,373 INFO L273 TraceCheckUtils]: 97: Hoare triple {16408#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16408#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:33,375 INFO L273 TraceCheckUtils]: 98: Hoare triple {16408#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16409#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:33,375 INFO L273 TraceCheckUtils]: 99: Hoare triple {16409#(<= main_~i~0 31)} assume true; {16409#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:33,376 INFO L273 TraceCheckUtils]: 100: Hoare triple {16409#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16409#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:33,376 INFO L273 TraceCheckUtils]: 101: Hoare triple {16409#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16410#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:33,377 INFO L273 TraceCheckUtils]: 102: Hoare triple {16410#(<= main_~i~0 32)} assume true; {16410#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:33,378 INFO L273 TraceCheckUtils]: 103: Hoare triple {16410#(<= main_~i~0 32)} assume !(~i~0 < 2048); {16377#false} is VALID [2018-11-14 17:33:33,378 INFO L273 TraceCheckUtils]: 104: Hoare triple {16377#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {16377#false} is VALID [2018-11-14 17:33:33,378 INFO L256 TraceCheckUtils]: 105: Hoare triple {16377#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16377#false} is VALID [2018-11-14 17:33:33,378 INFO L273 TraceCheckUtils]: 106: Hoare triple {16377#false} ~cond := #in~cond; {16377#false} is VALID [2018-11-14 17:33:33,378 INFO L273 TraceCheckUtils]: 107: Hoare triple {16377#false} assume ~cond == 0; {16377#false} is VALID [2018-11-14 17:33:33,378 INFO L273 TraceCheckUtils]: 108: Hoare triple {16377#false} assume !false; {16377#false} is VALID [2018-11-14 17:33:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:33,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:33,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:33,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:33:33,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:33:33,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:33,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:33,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {16376#true} call ULTIMATE.init(); {16376#true} is VALID [2018-11-14 17:33:33,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {16376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16376#true} is VALID [2018-11-14 17:33:33,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {16376#true} assume true; {16376#true} is VALID [2018-11-14 17:33:33,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16376#true} {16376#true} #36#return; {16376#true} is VALID [2018-11-14 17:33:33,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {16376#true} call #t~ret4 := main(); {16376#true} is VALID [2018-11-14 17:33:33,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {16376#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16429#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:33,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {16429#(<= main_~i~0 0)} assume true; {16429#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:33,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {16429#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16429#(<= main_~i~0 0)} is VALID [2018-11-14 17:33:33,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {16429#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16379#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:33,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {16379#(<= main_~i~0 1)} assume true; {16379#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:33,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {16379#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16379#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:33,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {16379#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16380#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:33,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {16380#(<= main_~i~0 2)} assume true; {16380#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:33,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {16380#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16380#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:33,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {16380#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16381#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:33,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {16381#(<= main_~i~0 3)} assume true; {16381#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:33,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {16381#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16381#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:33,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {16381#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16382#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:33,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {16382#(<= main_~i~0 4)} assume true; {16382#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:33,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {16382#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16382#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:33,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {16382#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16383#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:33,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {16383#(<= main_~i~0 5)} assume true; {16383#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:33,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {16383#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16383#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:33,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {16383#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16384#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:33,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {16384#(<= main_~i~0 6)} assume true; {16384#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:33,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {16384#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16384#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:33,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {16384#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16385#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:33,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {16385#(<= main_~i~0 7)} assume true; {16385#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:33,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {16385#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16385#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:33,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {16385#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16386#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:33,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {16386#(<= main_~i~0 8)} assume true; {16386#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:33,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {16386#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16386#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:33,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {16386#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16387#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:33,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {16387#(<= main_~i~0 9)} assume true; {16387#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:33,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {16387#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16387#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:33,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {16387#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16388#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:33,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {16388#(<= main_~i~0 10)} assume true; {16388#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:33,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {16388#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16388#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:33,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {16388#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16389#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:33,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {16389#(<= main_~i~0 11)} assume true; {16389#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:33,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {16389#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16389#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:33,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {16389#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16390#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:33,738 INFO L273 TraceCheckUtils]: 42: Hoare triple {16390#(<= main_~i~0 12)} assume true; {16390#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:33,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {16390#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16390#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:33,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {16390#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16391#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:33,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {16391#(<= main_~i~0 13)} assume true; {16391#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:33,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {16391#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16391#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:33,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {16391#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16392#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:33,742 INFO L273 TraceCheckUtils]: 48: Hoare triple {16392#(<= main_~i~0 14)} assume true; {16392#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:33,742 INFO L273 TraceCheckUtils]: 49: Hoare triple {16392#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16392#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:33,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {16392#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16393#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:33,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {16393#(<= main_~i~0 15)} assume true; {16393#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:33,744 INFO L273 TraceCheckUtils]: 52: Hoare triple {16393#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16393#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:33,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {16393#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16394#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:33,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {16394#(<= main_~i~0 16)} assume true; {16394#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:33,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {16394#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16394#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:33,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {16394#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16395#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:33,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {16395#(<= main_~i~0 17)} assume true; {16395#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:33,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {16395#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16395#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:33,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {16395#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16396#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:33,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {16396#(<= main_~i~0 18)} assume true; {16396#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:33,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {16396#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16396#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:33,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {16396#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16397#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:33,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {16397#(<= main_~i~0 19)} assume true; {16397#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:33,751 INFO L273 TraceCheckUtils]: 64: Hoare triple {16397#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16397#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:33,751 INFO L273 TraceCheckUtils]: 65: Hoare triple {16397#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16398#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:33,752 INFO L273 TraceCheckUtils]: 66: Hoare triple {16398#(<= main_~i~0 20)} assume true; {16398#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:33,752 INFO L273 TraceCheckUtils]: 67: Hoare triple {16398#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16398#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:33,753 INFO L273 TraceCheckUtils]: 68: Hoare triple {16398#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16399#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:33,754 INFO L273 TraceCheckUtils]: 69: Hoare triple {16399#(<= main_~i~0 21)} assume true; {16399#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:33,754 INFO L273 TraceCheckUtils]: 70: Hoare triple {16399#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16399#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:33,759 INFO L273 TraceCheckUtils]: 71: Hoare triple {16399#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16400#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:33,760 INFO L273 TraceCheckUtils]: 72: Hoare triple {16400#(<= main_~i~0 22)} assume true; {16400#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:33,760 INFO L273 TraceCheckUtils]: 73: Hoare triple {16400#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16400#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:33,760 INFO L273 TraceCheckUtils]: 74: Hoare triple {16400#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16401#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:33,761 INFO L273 TraceCheckUtils]: 75: Hoare triple {16401#(<= main_~i~0 23)} assume true; {16401#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:33,761 INFO L273 TraceCheckUtils]: 76: Hoare triple {16401#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16401#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:33,761 INFO L273 TraceCheckUtils]: 77: Hoare triple {16401#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16402#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:33,762 INFO L273 TraceCheckUtils]: 78: Hoare triple {16402#(<= main_~i~0 24)} assume true; {16402#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:33,762 INFO L273 TraceCheckUtils]: 79: Hoare triple {16402#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16402#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:33,762 INFO L273 TraceCheckUtils]: 80: Hoare triple {16402#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16403#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:33,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {16403#(<= main_~i~0 25)} assume true; {16403#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:33,763 INFO L273 TraceCheckUtils]: 82: Hoare triple {16403#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16403#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:33,764 INFO L273 TraceCheckUtils]: 83: Hoare triple {16403#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16404#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:33,765 INFO L273 TraceCheckUtils]: 84: Hoare triple {16404#(<= main_~i~0 26)} assume true; {16404#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:33,765 INFO L273 TraceCheckUtils]: 85: Hoare triple {16404#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16404#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:33,766 INFO L273 TraceCheckUtils]: 86: Hoare triple {16404#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16405#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:33,766 INFO L273 TraceCheckUtils]: 87: Hoare triple {16405#(<= main_~i~0 27)} assume true; {16405#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:33,767 INFO L273 TraceCheckUtils]: 88: Hoare triple {16405#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16405#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:33,768 INFO L273 TraceCheckUtils]: 89: Hoare triple {16405#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16406#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:33,768 INFO L273 TraceCheckUtils]: 90: Hoare triple {16406#(<= main_~i~0 28)} assume true; {16406#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:33,769 INFO L273 TraceCheckUtils]: 91: Hoare triple {16406#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16406#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:33,769 INFO L273 TraceCheckUtils]: 92: Hoare triple {16406#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16407#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:33,770 INFO L273 TraceCheckUtils]: 93: Hoare triple {16407#(<= main_~i~0 29)} assume true; {16407#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:33,770 INFO L273 TraceCheckUtils]: 94: Hoare triple {16407#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16407#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:33,771 INFO L273 TraceCheckUtils]: 95: Hoare triple {16407#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16408#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:33,771 INFO L273 TraceCheckUtils]: 96: Hoare triple {16408#(<= main_~i~0 30)} assume true; {16408#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:33,772 INFO L273 TraceCheckUtils]: 97: Hoare triple {16408#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16408#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:33,773 INFO L273 TraceCheckUtils]: 98: Hoare triple {16408#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16409#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:33,773 INFO L273 TraceCheckUtils]: 99: Hoare triple {16409#(<= main_~i~0 31)} assume true; {16409#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:33,774 INFO L273 TraceCheckUtils]: 100: Hoare triple {16409#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16409#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:33,774 INFO L273 TraceCheckUtils]: 101: Hoare triple {16409#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16410#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:33,775 INFO L273 TraceCheckUtils]: 102: Hoare triple {16410#(<= main_~i~0 32)} assume true; {16410#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:33,776 INFO L273 TraceCheckUtils]: 103: Hoare triple {16410#(<= main_~i~0 32)} assume !(~i~0 < 2048); {16377#false} is VALID [2018-11-14 17:33:33,776 INFO L273 TraceCheckUtils]: 104: Hoare triple {16377#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {16377#false} is VALID [2018-11-14 17:33:33,776 INFO L256 TraceCheckUtils]: 105: Hoare triple {16377#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16377#false} is VALID [2018-11-14 17:33:33,776 INFO L273 TraceCheckUtils]: 106: Hoare triple {16377#false} ~cond := #in~cond; {16377#false} is VALID [2018-11-14 17:33:33,777 INFO L273 TraceCheckUtils]: 107: Hoare triple {16377#false} assume ~cond == 0; {16377#false} is VALID [2018-11-14 17:33:33,777 INFO L273 TraceCheckUtils]: 108: Hoare triple {16377#false} assume !false; {16377#false} is VALID [2018-11-14 17:33:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:33,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:33,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-14 17:33:33,814 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-14 17:33:33,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:33,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 17:33:33,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:33,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 17:33:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 17:33:33,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:33:33,927 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 36 states. [2018-11-14 17:33:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:34,382 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-14 17:33:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:33:34,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-14 17:33:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:33:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 120 transitions. [2018-11-14 17:33:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:33:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 120 transitions. [2018-11-14 17:33:34,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 120 transitions. [2018-11-14 17:33:34,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:34,496 INFO L225 Difference]: With dead ends: 120 [2018-11-14 17:33:34,496 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 17:33:34,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:33:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 17:33:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-14 17:33:34,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:34,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 113 states. [2018-11-14 17:33:34,528 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 113 states. [2018-11-14 17:33:34,528 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 113 states. [2018-11-14 17:33:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:34,531 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-14 17:33:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-14 17:33:34,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:34,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:34,531 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 114 states. [2018-11-14 17:33:34,531 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 114 states. [2018-11-14 17:33:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:34,533 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-14 17:33:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-14 17:33:34,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:34,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:34,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:34,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 17:33:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-11-14 17:33:34,536 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-11-14 17:33:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:34,536 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-11-14 17:33:34,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 17:33:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-11-14 17:33:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:33:34,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:34,537 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:34,537 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:34,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1861994138, now seen corresponding path program 33 times [2018-11-14 17:33:34,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:34,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:34,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:35,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {17281#true} call ULTIMATE.init(); {17281#true} is VALID [2018-11-14 17:33:35,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {17281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17281#true} is VALID [2018-11-14 17:33:35,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {17281#true} assume true; {17281#true} is VALID [2018-11-14 17:33:35,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17281#true} {17281#true} #36#return; {17281#true} is VALID [2018-11-14 17:33:35,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {17281#true} call #t~ret4 := main(); {17281#true} is VALID [2018-11-14 17:33:35,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {17281#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17283#(= main_~i~0 0)} is VALID [2018-11-14 17:33:35,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {17283#(= main_~i~0 0)} assume true; {17283#(= main_~i~0 0)} is VALID [2018-11-14 17:33:35,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {17283#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17283#(= main_~i~0 0)} is VALID [2018-11-14 17:33:35,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {17283#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17284#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:35,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {17284#(<= main_~i~0 1)} assume true; {17284#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:35,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {17284#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17284#(<= main_~i~0 1)} is VALID [2018-11-14 17:33:35,389 INFO L273 TraceCheckUtils]: 11: Hoare triple {17284#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17285#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:35,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {17285#(<= main_~i~0 2)} assume true; {17285#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:35,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {17285#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17285#(<= main_~i~0 2)} is VALID [2018-11-14 17:33:35,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {17285#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17286#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:35,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {17286#(<= main_~i~0 3)} assume true; {17286#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:35,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {17286#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17286#(<= main_~i~0 3)} is VALID [2018-11-14 17:33:35,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {17286#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17287#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:35,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {17287#(<= main_~i~0 4)} assume true; {17287#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:35,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {17287#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17287#(<= main_~i~0 4)} is VALID [2018-11-14 17:33:35,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {17287#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17288#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:35,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {17288#(<= main_~i~0 5)} assume true; {17288#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:35,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {17288#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17288#(<= main_~i~0 5)} is VALID [2018-11-14 17:33:35,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {17288#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17289#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:35,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {17289#(<= main_~i~0 6)} assume true; {17289#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:35,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {17289#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17289#(<= main_~i~0 6)} is VALID [2018-11-14 17:33:35,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {17289#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17290#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:35,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {17290#(<= main_~i~0 7)} assume true; {17290#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:35,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {17290#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17290#(<= main_~i~0 7)} is VALID [2018-11-14 17:33:35,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {17290#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17291#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:35,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {17291#(<= main_~i~0 8)} assume true; {17291#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:35,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {17291#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17291#(<= main_~i~0 8)} is VALID [2018-11-14 17:33:35,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {17291#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17292#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:35,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {17292#(<= main_~i~0 9)} assume true; {17292#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:35,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {17292#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17292#(<= main_~i~0 9)} is VALID [2018-11-14 17:33:35,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {17292#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17293#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:35,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {17293#(<= main_~i~0 10)} assume true; {17293#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:35,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {17293#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17293#(<= main_~i~0 10)} is VALID [2018-11-14 17:33:35,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {17293#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17294#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:35,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {17294#(<= main_~i~0 11)} assume true; {17294#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:35,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {17294#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17294#(<= main_~i~0 11)} is VALID [2018-11-14 17:33:35,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {17294#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17295#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:35,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {17295#(<= main_~i~0 12)} assume true; {17295#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:35,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {17295#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17295#(<= main_~i~0 12)} is VALID [2018-11-14 17:33:35,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {17295#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17296#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:35,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {17296#(<= main_~i~0 13)} assume true; {17296#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:35,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {17296#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17296#(<= main_~i~0 13)} is VALID [2018-11-14 17:33:35,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {17296#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17297#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:35,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {17297#(<= main_~i~0 14)} assume true; {17297#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:35,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {17297#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17297#(<= main_~i~0 14)} is VALID [2018-11-14 17:33:35,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {17297#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17298#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:35,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {17298#(<= main_~i~0 15)} assume true; {17298#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:35,412 INFO L273 TraceCheckUtils]: 52: Hoare triple {17298#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17298#(<= main_~i~0 15)} is VALID [2018-11-14 17:33:35,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {17298#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17299#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:35,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {17299#(<= main_~i~0 16)} assume true; {17299#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:35,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {17299#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17299#(<= main_~i~0 16)} is VALID [2018-11-14 17:33:35,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {17299#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17300#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:35,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {17300#(<= main_~i~0 17)} assume true; {17300#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:35,415 INFO L273 TraceCheckUtils]: 58: Hoare triple {17300#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17300#(<= main_~i~0 17)} is VALID [2018-11-14 17:33:35,416 INFO L273 TraceCheckUtils]: 59: Hoare triple {17300#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17301#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:35,416 INFO L273 TraceCheckUtils]: 60: Hoare triple {17301#(<= main_~i~0 18)} assume true; {17301#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:35,417 INFO L273 TraceCheckUtils]: 61: Hoare triple {17301#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17301#(<= main_~i~0 18)} is VALID [2018-11-14 17:33:35,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {17301#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17302#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:35,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {17302#(<= main_~i~0 19)} assume true; {17302#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:35,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {17302#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17302#(<= main_~i~0 19)} is VALID [2018-11-14 17:33:35,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {17302#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17303#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:35,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {17303#(<= main_~i~0 20)} assume true; {17303#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:35,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {17303#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17303#(<= main_~i~0 20)} is VALID [2018-11-14 17:33:35,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {17303#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17304#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:35,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {17304#(<= main_~i~0 21)} assume true; {17304#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:35,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {17304#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17304#(<= main_~i~0 21)} is VALID [2018-11-14 17:33:35,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {17304#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17305#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:35,423 INFO L273 TraceCheckUtils]: 72: Hoare triple {17305#(<= main_~i~0 22)} assume true; {17305#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:35,424 INFO L273 TraceCheckUtils]: 73: Hoare triple {17305#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17305#(<= main_~i~0 22)} is VALID [2018-11-14 17:33:35,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {17305#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17306#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:35,425 INFO L273 TraceCheckUtils]: 75: Hoare triple {17306#(<= main_~i~0 23)} assume true; {17306#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:35,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {17306#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17306#(<= main_~i~0 23)} is VALID [2018-11-14 17:33:35,426 INFO L273 TraceCheckUtils]: 77: Hoare triple {17306#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17307#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:35,427 INFO L273 TraceCheckUtils]: 78: Hoare triple {17307#(<= main_~i~0 24)} assume true; {17307#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:35,427 INFO L273 TraceCheckUtils]: 79: Hoare triple {17307#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17307#(<= main_~i~0 24)} is VALID [2018-11-14 17:33:35,428 INFO L273 TraceCheckUtils]: 80: Hoare triple {17307#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17308#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:35,429 INFO L273 TraceCheckUtils]: 81: Hoare triple {17308#(<= main_~i~0 25)} assume true; {17308#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:35,429 INFO L273 TraceCheckUtils]: 82: Hoare triple {17308#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17308#(<= main_~i~0 25)} is VALID [2018-11-14 17:33:35,430 INFO L273 TraceCheckUtils]: 83: Hoare triple {17308#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17309#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:35,430 INFO L273 TraceCheckUtils]: 84: Hoare triple {17309#(<= main_~i~0 26)} assume true; {17309#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:35,431 INFO L273 TraceCheckUtils]: 85: Hoare triple {17309#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17309#(<= main_~i~0 26)} is VALID [2018-11-14 17:33:35,431 INFO L273 TraceCheckUtils]: 86: Hoare triple {17309#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17310#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:35,432 INFO L273 TraceCheckUtils]: 87: Hoare triple {17310#(<= main_~i~0 27)} assume true; {17310#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:35,432 INFO L273 TraceCheckUtils]: 88: Hoare triple {17310#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17310#(<= main_~i~0 27)} is VALID [2018-11-14 17:33:35,433 INFO L273 TraceCheckUtils]: 89: Hoare triple {17310#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17311#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:35,434 INFO L273 TraceCheckUtils]: 90: Hoare triple {17311#(<= main_~i~0 28)} assume true; {17311#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:35,434 INFO L273 TraceCheckUtils]: 91: Hoare triple {17311#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17311#(<= main_~i~0 28)} is VALID [2018-11-14 17:33:35,435 INFO L273 TraceCheckUtils]: 92: Hoare triple {17311#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17312#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:35,435 INFO L273 TraceCheckUtils]: 93: Hoare triple {17312#(<= main_~i~0 29)} assume true; {17312#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:35,436 INFO L273 TraceCheckUtils]: 94: Hoare triple {17312#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17312#(<= main_~i~0 29)} is VALID [2018-11-14 17:33:35,437 INFO L273 TraceCheckUtils]: 95: Hoare triple {17312#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17313#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:35,437 INFO L273 TraceCheckUtils]: 96: Hoare triple {17313#(<= main_~i~0 30)} assume true; {17313#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:35,438 INFO L273 TraceCheckUtils]: 97: Hoare triple {17313#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17313#(<= main_~i~0 30)} is VALID [2018-11-14 17:33:35,438 INFO L273 TraceCheckUtils]: 98: Hoare triple {17313#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17314#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:35,439 INFO L273 TraceCheckUtils]: 99: Hoare triple {17314#(<= main_~i~0 31)} assume true; {17314#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:35,439 INFO L273 TraceCheckUtils]: 100: Hoare triple {17314#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17314#(<= main_~i~0 31)} is VALID [2018-11-14 17:33:35,440 INFO L273 TraceCheckUtils]: 101: Hoare triple {17314#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17315#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:35,441 INFO L273 TraceCheckUtils]: 102: Hoare triple {17315#(<= main_~i~0 32)} assume true; {17315#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:35,441 INFO L273 TraceCheckUtils]: 103: Hoare triple {17315#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17315#(<= main_~i~0 32)} is VALID [2018-11-14 17:33:35,442 INFO L273 TraceCheckUtils]: 104: Hoare triple {17315#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {17316#(<= main_~i~0 33)} is VALID [2018-11-14 17:33:35,442 INFO L273 TraceCheckUtils]: 105: Hoare triple {17316#(<= main_~i~0 33)} assume true; {17316#(<= main_~i~0 33)} is VALID [2018-11-14 17:33:35,443 INFO L273 TraceCheckUtils]: 106: Hoare triple {17316#(<= main_~i~0 33)} assume !(~i~0 < 2048); {17282#false} is VALID [2018-11-14 17:33:35,443 INFO L273 TraceCheckUtils]: 107: Hoare triple {17282#false} call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4096, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + 4096, 4); {17282#false} is VALID [2018-11-14 17:33:35,443 INFO L256 TraceCheckUtils]: 108: Hoare triple {17282#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17282#false} is VALID [2018-11-14 17:33:35,444 INFO L273 TraceCheckUtils]: 109: Hoare triple {17282#false} ~cond := #in~cond; {17282#false} is VALID [2018-11-14 17:33:35,444 INFO L273 TraceCheckUtils]: 110: Hoare triple {17282#false} assume ~cond == 0; {17282#false} is VALID [2018-11-14 17:33:35,444 INFO L273 TraceCheckUtils]: 111: Hoare triple {17282#false} assume !false; {17282#false} is VALID [2018-11-14 17:33:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:35,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:35,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:35,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2